refactor: change packages

src/main/java/com/thealgorithms/dynamicprogramming/FordFulkerson.java → src/main/java/com/thealgorithms/datastructures/graphs/FordFulkerson.java

@@ -1,4 +1,4 @@
-package com.thealgorithms.dynamicprogramming;
+package com.thealgorithms.datastructures.graphs;
 
 import java.util.LinkedList;
 import java.util.Queue;

src/main/java/com/thealgorithms/dynamicprogramming/ShortestCommonSupersequenceLength.java

@@ -5,8 +5,8 @@
  * supersequence of two given strings. The shortest supersequence is the smallest string
  * that contains both given strings as subsequences.
  */
-final class ShortestCommonSuperSequenceLength {
-    private ShortestCommonSuperSequenceLength() {
+final class ShortestCommonSupersequenceLength {
+    private ShortestCommonSupersequenceLength() {
     }
 
     /**

src/main/java/com/thealgorithms/others/EulersFunction.java → src/main/java/com/thealgorithms/maths/EulersFunction.java

@@ -1,4 +1,4 @@
-package com.thealgorithms.others;
+package com.thealgorithms.maths;
 
 /**
  * Utility class for computing

src/main/java/com/thealgorithms/others/SieveOfEratosthenes.java → src/main/java/com/thealgorithms/maths/SieveOfEratosthenes.java

@@ -1,4 +1,4 @@
-package com.thealgorithms.others;
+package com.thealgorithms.maths;
 
 import java.util.Arrays;
 

src/main/java/com/thealgorithms/others/KMP.java → src/main/java/com/thealgorithms/strings/KMP.java

@@ -1,4 +1,4 @@
-package com.thealgorithms.others;
+package com.thealgorithms.strings;
 
 /**
  * Implementation of Knuth–Morris–Pratt algorithm Usage: see the main function

src/main/java/com/thealgorithms/others/RabinKarp.java → src/main/java/com/thealgorithms/strings/RabinKarp.java

@@ -1,4 +1,4 @@
-package com.thealgorithms.others;
+package com.thealgorithms.strings;
 
 import java.util.Scanner;
 

src/test/java/com/thealgorithms/dynamicprogramming/FordFulkersonTest.java → src/test/java/com/thealgorithms/datastructures/graphs/FordFulkersonTest.java

@@ -1,4 +1,4 @@
-package com.thealgorithms.dynamicprogramming;
+package com.thealgorithms.datastructures.graphs;
 
 import static org.junit.jupiter.api.Assertions.assertEquals;
 

src/test/java/com/thealgorithms/dynamicprogramming/ShortestCommonSuperSequenceLengthTest.java → src/test/java/com/thealgorithms/dynamicprogramming/ShortestCommonSupersequenceLengthTest.java

@@ -5,10 +5,10 @@
 import org.junit.jupiter.params.ParameterizedTest;
 import org.junit.jupiter.params.provider.CsvSource;
 
-public class ShortestCommonSuperSequenceLengthTest {
+public class ShortestCommonSupersequenceLengthTest {
     @ParameterizedTest
     @CsvSource({"AGGTAB, GXTXAYB, 9", "ABC, ABC, 3", "ABC, DEF, 6", "'', ABC, 3", "ABCD, AB, 4", "ABC, BCD, 4", "A, B, 2"})
-    void testShortestSuperSequence(String input1, String input2, int expected) {
-        assertEquals(expected, ShortestCommonSuperSequenceLength.shortestSuperSequence(input1, input2));
+    void testShortestSupersequence(String input1, String input2, int expected) {
+        assertEquals(expected, ShortestCommonSupersequenceLength.shortestSuperSequence(input1, input2));
     }
 }

src/test/java/com/thealgorithms/others/EulersFunctionTest.java → src/test/java/com/thealgorithms/maths/EulersFunctionTest.java

@@ -1,4 +1,4 @@
-package com.thealgorithms.others;
+package com.thealgorithms.maths;
 
 import static org.junit.jupiter.api.Assertions.assertEquals;
 import static org.junit.jupiter.api.Assertions.assertThrows;

src/test/java/com/thealgorithms/others/SieveOfEratosthenesTest.java → src/test/java/com/thealgorithms/maths/SieveOfEratosthenesTest.java

@@ -1,4 +1,4 @@
-package com.thealgorithms.others;
+package com.thealgorithms.maths;
 
 import static org.junit.jupiter.api.Assertions.assertArrayEquals;
 import static org.junit.jupiter.api.Assertions.assertThrows;