From b2f6827c365da978991c8c1639ed74953d3f8b96 Mon Sep 17 00:00:00 2001 From: Ankush Banik <86042508+Ankush263@users.noreply.github.com> Date: Tue, 12 Jul 2022 11:59:49 +0530 Subject: [PATCH] Add Tests for DigitalRoot Algorithm (#3186) --- .../com/thealgorithms/maths/DigitalRoot.java | 6 ------ .../thealgorithms/maths/DigitalRootTest.java | 20 +++++++++++++++++++ 2 files changed, 20 insertions(+), 6 deletions(-) create mode 100644 src/test/java/com/thealgorithms/maths/DigitalRootTest.java diff --git a/src/main/java/com/thealgorithms/maths/DigitalRoot.java b/src/main/java/com/thealgorithms/maths/DigitalRoot.java index e973d55b4..73aed0854 100644 --- a/src/main/java/com/thealgorithms/maths/DigitalRoot.java +++ b/src/main/java/com/thealgorithms/maths/DigitalRoot.java @@ -60,12 +60,6 @@ class DigitalRoot { } // n / 10 is the number obtainded after removing the digit one by one // Sum of digits is stored in the Stack memory and then finally returned - public static void main(String[] args) { - Scanner sc = new Scanner(System.in); - System.out.println("Enter the number : "); - int n = sc.nextInt(); // Taking a number as input from the user - System.out.println("Digital Root : " + digitalRoot(n)); // Printing the value returned by digitalRoot() method - } } /** diff --git a/src/test/java/com/thealgorithms/maths/DigitalRootTest.java b/src/test/java/com/thealgorithms/maths/DigitalRootTest.java new file mode 100644 index 000000000..7c10ed0d3 --- /dev/null +++ b/src/test/java/com/thealgorithms/maths/DigitalRootTest.java @@ -0,0 +1,20 @@ +package com.thealgorithms.maths; + +import static org.junit.jupiter.api.Assertions.assertEquals; + +import org.junit.jupiter.api.Test; + +public class DigitalRootTest { + + @Test + void testDigitalroot() { + + assertEquals(4, DigitalRoot.digitalRoot(4)); + assertEquals(9, DigitalRoot.digitalRoot(9)); + assertEquals(4, DigitalRoot.digitalRoot(49)); + assertEquals(6, DigitalRoot.digitalRoot(78)); + assertEquals(4, DigitalRoot.digitalRoot(1228)); + assertEquals(5, DigitalRoot.digitalRoot(71348)); + + } +}