OpenGenus/cosmos

Find the gcd and lcm of a number

Open

#688 opened on Oct 6, 2017

View on GitHubContributor guide
 (9 comments) (0 reactions) (0 assignees)C++ (3,724 forks)batch import
Hacktoberfestadd codenew algorithm

Repository metrics

Stars
 (13,462 stars)
PR merge metrics
 (No merged PRs in 30d)

Description

Can I implement this in C++?

Contributor guide

Research direction
Implement a C++ function for GCD using Euclidean algorithm and LCM using the relation LCM = a*b/GCD. Ensure the function handles edge cases like zero. Follow the repository's directory structure and coding style.
Tech stack
cpp
Domain
backend
Issue type
Feature
DifficultyEstimated implementation difficulty for a new contributor, from 1 for very small changes to 5 for expert-level work.
1
Estimated timeA rough time range for an experienced contributor to investigate, implement, test, and prepare a pull request.
Under 1 hour
Activity statusHow available the issue appears right now: fresh, active, stale, blocked, or waiting on maintainer input.
Active
ClarityHow clearly the issue explains the expected change, acceptance criteria, and next step.
Clear
Prerequisites
GitC++
Newbie friendlinessA 1-100 score estimating how approachable this issue is for first-time contributors.
85