docs: fix typos in comments

Fix misspellings found with codespell: reccur/reccuring, positon,
choosed, increate, contantating, and "Hava a Eulerian Path". Also
rename the local variable formater to formatter in MathBuilder.

Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>

Author: jxpark24

src/main/java/com/thealgorithms/datastructures/lists/QuickSortLinkedList.java

@@ -20,7 +20,7 @@
  *      List lessThanPivot : 3 -> 1 -> 2 -> 4
  *      List greaterThanPivot : 5 -> 8 -> 10 -> 7 -> 9 -> 6
  *
- *      -> reccur for lessThanPivot and greaterThanPivot
+ *      -> recur for lessThanPivot and greaterThanPivot
  *
  *            lessThanPivot :
  *                current pivot : 3
@@ -32,7 +32,7 @@
  *                 lessThanPivot : null
  *                 greaterThanPivot : 8 -> 10 -> 7 -> 9 -> 6
  *
- *        By following the above pattern, reccuring tree will form like below :
+ *        By following the above pattern, the recursion tree will form like below :
  *
  *        List-> 5 -> 3 -> 8 -> 1 -> 10 -> 2 -> 7 -> 4 -> 9 -> 6
  *
@@ -66,7 +66,7 @@
  *                                       (N)   (N)   (N)   (N)
  *
  *
- *      -> After this the tree will reccur back (or backtrack)
+ *      -> After this the tree will recur back (or backtrack)
  *         and the returning list from left and right subtree will attach
  *         themselves around pivot.
  *         i.e. ,

src/main/java/com/thealgorithms/datastructures/queues/PriorityQueues.java

@@ -85,7 +85,7 @@ private void swim(int pos) {
     private void sink(int pos) {
         // Check if node's position is that of parent node
         while (2 * pos <= nItems) {
-            int current = 2 * pos; // Jump to the positon of child node
+            int current = 2 * pos; // Jump to the position of child node
             // Compare both the children for the greater one
             if (current < nItems && queueArray[current] < queueArray[current + 1]) {
                 current++;

src/main/java/com/thealgorithms/maths/MathBuilder.java

@@ -481,17 +481,17 @@ public Builder closeParenthesisAndDivide() {
         }
 
         public Builder format(String format) {
-            DecimalFormat formater = new DecimalFormat(format);
-            String num = formater.format(number);
+            DecimalFormat formatter = new DecimalFormat(format);
+            String num = formatter.format(number);
             number = Double.parseDouble(num);
             return this;
         }
 
         public Builder format(int decimalPlace) {
             String pattern = "."
                 + "#".repeat(decimalPlace);
-            DecimalFormat formater = new DecimalFormat(pattern);
-            String num = formater.format(number);
+            DecimalFormat formatter = new DecimalFormat(pattern);
+            String num = formatter.format(number);
             number = Double.parseDouble(num);
             return this;
         }

src/main/java/com/thealgorithms/sorts/LinkListSort.java

@@ -13,7 +13,7 @@ public static boolean isSorted(int[] p, int option) {
         int[] b = p;
         // array similar to a
         int ch = option;
-        // Choice is choosed as any number from 1 to 3 (So the linked list will be
+        // Choice is chosen as any number from 1 to 3 (So the linked list will be
         // sorted by Merge sort technique/Insertion sort technique/Heap sort technique)
         switch (ch) {
         case 1:

src/main/java/com/thealgorithms/strings/zigZagPattern/README.md

@@ -28,8 +28,8 @@ for example :
     height which starts with 1 and start with starting index of string.
     than we generate spaces to skip using formula 2 + (( n - 1 ) * 2 )
     for both height and depth
-    with each iteration we decrement depth and increate height and start 
-    by one also we keep contantating character on to new string with first
+    with each iteration we decrement depth and increase height and start 
+    by one also we keep concatenating character on to new string with first
     depth spaces and later height spaces that we generated using formula
     if not zero
 

src/test/java/com/thealgorithms/graph/HierholzerEulerianPathTest.java

@@ -153,7 +153,7 @@ void testMultipleEdgesBetweenSameNodes() {
         HierholzerEulerianPath solver = new HierholzerEulerianPath(graph);
         List<Integer> result = solver.findEulerianPath();
 
-        // Hava a Eulerian Path but not a Eulerian Circuit
+        // Has an Eulerian Path but not an Eulerian Circuit
         assertEquals(result, Arrays.asList(0, 1, 2, 0, 1));
     }