chore: fix some comments (#5333)

mountdisk · web-flow · commit 7c58b190c8eb · 2024-08-16T20:19:15.000+03:00
diff --git a/src/main/java/com/thealgorithms/backtracking/ParenthesesGenerator.java b/src/main/java/com/thealgorithms/backtracking/ParenthesesGenerator.java
@@ -19,7 +19,7 @@ private ParenthesesGenerator() {
      */
     public static List<String> generateParentheses(final int n) {
         if (n < 0) {
-            throw new IllegalArgumentException("The number of pairs of parentheses cannot be nagative");
+            throw new IllegalArgumentException("The number of pairs of parentheses cannot be negative");
         }
         List<String> result = new ArrayList<>();
         generateParenthesesHelper(result, "", 0, 0, n);
diff --git a/src/main/java/com/thealgorithms/datastructures/trees/BSTRecursive.java b/src/main/java/com/thealgorithms/datastructures/trees/BSTRecursive.java
@@ -95,7 +95,7 @@ private Node insert(Node node, int data) {
     }
 
     /**
-     * Serach recursively if the given value is present in BST or not.
+     * Search recursively if the given value is present in BST or not.
      *
      * @param node the current node to check
      * @param data the value to be checked
diff --git a/src/main/java/com/thealgorithms/misc/PalindromePrime.java b/src/main/java/com/thealgorithms/misc/PalindromePrime.java
@@ -6,7 +6,7 @@ public final class PalindromePrime {
     private PalindromePrime() {
     }
 
-    public static void main(String[] args) { // Main funtion
+    public static void main(String[] args) { // Main function
         Scanner in = new Scanner(System.in);
         System.out.println("Enter the quantity of First Palindromic Primes you want");
         int n = in.nextInt(); // Input of how many first palindromic prime we want
diff --git a/src/main/java/com/thealgorithms/searches/HowManyTimesRotated.java b/src/main/java/com/thealgorithms/searches/HowManyTimesRotated.java
@@ -17,7 +17,7 @@
     from its initial sorted position.
     Eg. For [2,5,6,8,11,12,15,18], 1 rotation gives [5,6,8,11,12,15,18,2], 2 rotations
    [6,8,11,12,15,18,2,5] and so on. Finding the minimum element will take O(N) time but, we can  use
-   Binary Search to find the mimimum element, we can reduce the complexity to O(log N). If we look
+   Binary Search to find the minimum element, we can reduce the complexity to O(log N). If we look
    at the rotated array, to identify the minimum element (say a[i]), we observe that
    a[i-1]>a[i]<a[i+1].
 
diff --git a/src/test/java/com/thealgorithms/maths/FFTTest.java b/src/test/java/com/thealgorithms/maths/FFTTest.java
@@ -40,7 +40,7 @@ void addFalseTest() {
         assertNotEquals(2.0, add);
     }
 
-    // Testing the function substract, assertEqual test
+    // Testing the function subtract, assertEqual test
     @Test
     void subtractTest() {
         FFT.Complex complex1 = new FFT.Complex(2.0, 2.0);

Original file line number	Diff line number	Diff line change
`@@ -19,7 +19,7 @@ private ParenthesesGenerator() {`
`19`	`19`	`*/`
`20`	`20`	`public static List<String> generateParentheses(final int n) {`
`21`	`21`	`if (n < 0) {`
`22`		`- throw new IllegalArgumentException("The number of pairs of parentheses cannot be nagative");`
	`22`	`+ throw new IllegalArgumentException("The number of pairs of parentheses cannot be negative");`
`23`	`23`	`}`
`24`	`24`	`List<String> result = new ArrayList<>();`
`25`	`25`	`generateParenthesesHelper(result, "", 0, 0, n);`
Original file line number	Diff line number	Diff line change
`@@ -95,7 +95,7 @@ private Node insert(Node node, int data) {`
`95`	`95`	`}`
`96`	`96`
`97`	`97`	`/**`
`98`		`- * Serach recursively if the given value is present in BST or not.`
	`98`	`+ * Search recursively if the given value is present in BST or not.`
`99`	`99`	`*`
`100`	`100`	`* @param node the current node to check`
`101`	`101`	`* @param data the value to be checked`
Original file line number	Diff line number	Diff line change
`@@ -6,7 +6,7 @@ public final class PalindromePrime {`
`6`	`6`	`private PalindromePrime() {`
`7`	`7`	`}`
`8`	`8`
`9`		`- public static void main(String[] args) { // Main funtion`
	`9`	`+ public static void main(String[] args) { // Main function`
`10`	`10`	`Scanner in = new Scanner(System.in);`
`11`	`11`	`System.out.println("Enter the quantity of First Palindromic Primes you want");`
`12`	`12`	`int n = in.nextInt(); // Input of how many first palindromic prime we want`
Original file line number	Diff line number	Diff line change
`@@ -40,7 +40,7 @@ void addFalseTest() {`
`40`	`40`	`assertNotEquals(2.0, add);`
`41`	`41`	`}`
`42`	`42`
`43`		`- // Testing the function substract, assertEqual test`
	`43`	`+ // Testing the function subtract, assertEqual test`
`44`	`44`	`@Test`
`45`	`45`	`void subtractTest() {`
`46`	`46`	`FFT.Complex complex1 = new FFT.Complex(2.0, 2.0);`