Skip to content

tests: add tests for GenericRoot #4276

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
siriak merged 5 commits into from
Aug 3, 2023
Merged

tests: add tests for GenericRoot #4276

Changes from 1 commit
Commits
Show all changes
5 commits
Select commit Hold shift + click to select a range
7eb4d88
tests: add `GenericRootTest`
vil02 Jul 31, 2023
3531ea1
fix: handle negative inputs
vil02 Jul 31, 2023
6ec1b90
refactor: simplify `genericRoot` by using recursion
vil02 Jul 31, 2023
12fbb33
refactor: make`GenericRoot` a proper utility class
vil02 Jul 31, 2023
fec00bf
style: add `base`, mark input args as `final`
vil02 Jul 31, 2023
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
Prev Previous commit
Next Next commit
refactor: simplify genericRoot by using recursion
  • Loading branch information
@vil02
vil02 committed Jul 31, 2023
commit 6ec1b90e2dcce1ad65381dc502e07e9d324143cb
20 changes: 11 additions & 9 deletions src/main/java/com/thealgorithms/maths/GenericRoot.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -15,19 +15,21 @@ public static void main(String[] args) {
System.out.println("Generic root of " + number2 + " is: " + result2);
}

private static int sumOfDigits(int n) {
assert n >= 0;
if (n < 10) {
return n;
}
return n % 10 + sumOfDigits(n / 10);
}

public static int genericRoot(int n) {
if (n < 0) {
return genericRoot(-n);
}
int root = 0;
while (n > 0 || root > 9) {
if (n == 0) {
n = root;
root = 0;
}
root += n % 10;
n /= 10;
if (n > 10) {
return genericRoot(sumOfDigits(n));
}
return root;
return n;
}
}