Skip to content

Added GetGCD and ReverseNumber method in Maths category. #670

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 6 commits into from
Aug 31, 2021
Merged

Added GetGCD and ReverseNumber method in Maths category. #670

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
6 commits
Select commit Hold shift + click to select a range
10373dd
add GetGCD method
suryapratapsinghsuryavanshi Aug 30, 2021
60b185d
re-formate GetGCD with standard.js
suryapratapsinghsuryavanshi Aug 30, 2021
d7e8bf4
fix types error in GetGCD method
suryapratapsinghsuryavanshi Aug 30, 2021
c67b0e9
add ReverseNumber method
suryapratapsinghsuryavanshi Aug 30, 2021
92b8b46
add type checking
suryapratapsinghsuryavanshi Aug 31, 2021
09ce0c7
change the GetGCD method to GetEuclidGCD method
suryapratapsinghsuryavanshi Aug 31, 2021
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
32 changes: 32 additions & 0 deletions Maths/GetEuclidGCD.js
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,32 @@
/*
Problem statement and Explanation : https://en.wikipedia.org/wiki/Euclidean_algorithm

In this method, we have followed the iterative approach to first
find a minimum of both numbers and go to the next step.
*/

/**
* GetEuclidGCD return the gcd of two numbers using Euclidean algorithm.
* @param {Number} arg1 first argument for gcd
* @param {Number} arg2 second argument for gcd
* @returns return a `gcd` value of both number.
*/
const GetEuclidGCD = (arg1, arg2) => {
// firstly, check that input is a number or not.
if (typeof arg1 !== 'number' || typeof arg2 !== 'number') {
return new TypeError('Argument is not a number.')
}
// check that the input number is not a negative value.
if (arg1 < 1 || arg2 < 1) {
return new TypeError('Argument is a negative number.')
}
// Find a minimum of both numbers.
let less = arg1 > arg2 ? arg2 : arg1
// Iterate the number and find the gcd of the number using the above explanation.
for (less; less >= 2; less--) {
if ((arg1 % less === 0) && (arg2 % less === 0)) return (less)
}
return (less)
}

module.exports = GetEuclidGCD
29 changes: 29 additions & 0 deletions Maths/ReverseNumber.js
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,29 @@
/*
Problem statement and Explanation : https://medium.com/@ManBearPigCode/how-to-reverse-a-number-mathematically-97c556626ec6
*/

/**
* ReverseNumber return the reversed value of the given number.
* @param {Number} n any digit number.
* @returns `Number` n reverse in reverse.
*/
const ReverseNumber = (number) => {
// firstly, check that input is a number or not.
if (typeof number !== 'number') {
return new TypeError('Argument is not a number.')
}
// A variable for storing the reversed number.
let reverseNumber = 0
// Iterate the process until getting the number is 0.
while (number > 0) {
// get the last digit of the number
const lastDigit = number % 10
// add to the last digit to in reverseNumber
reverseNumber = reverseNumber * 10 + lastDigit
// reduce the actual number.
number = Math.floor(number / 10)
}
return reverseNumber
}

module.exports = ReverseNumber