chore: enforce InsertNewlineAtEOF in clang-format (#4343)

* style: insert newline at eof

* style: use `InsertNewlineAtEOF` in `clang-format`

* fix: use `clang-format-16`

* chore: update clang-format-lint-action to v0.16.2

---------

Co-authored-by: Debasish Biswas <debasishbsws.dev@gmail.com>

src/main/java/com/thealgorithms/backtracking/AllPathsFromSourceToTarget.java

@@ -98,4 +98,4 @@ public class AllPathsFromSourceToTarget {
         return nm;
         // returns all possible paths from source to destination
     }
-}
+}

src/main/java/com/thealgorithms/backtracking/ArrayCombination.java

@@ -26,4 +26,4 @@ public class ArrayCombination {
         }
         return Combination.combination(arr, length);
     }
-}
+}

src/main/java/com/thealgorithms/bitmanipulation/IndexOfRightMostSetBit.java

@@ -25,4 +25,4 @@ public class IndexOfRightMostSetBit {
 
         return index;
     }
-}
+}

src/main/java/com/thealgorithms/bitmanipulation/IsEven.java

@@ -9,4 +9,4 @@ public class IsEven {
     public static boolean isEven(int number) {
         return (number & 1) == 0;
     }
-}
+}

src/main/java/com/thealgorithms/bitmanipulation/NonRepeatingNumberFinder.java

@@ -14,4 +14,4 @@ public class NonRepeatingNumberFinder {
         }
         return result;
     }
-}
+}

src/main/java/com/thealgorithms/bitmanipulation/NumbersDifferentSigns.java

@@ -10,4 +10,4 @@ public class NumbersDifferentSigns {
     public static boolean differentSigns(int num1, int num2) {
         return (num1 ^ num2) < 0;
     }
-}
+}

src/main/java/com/thealgorithms/bitmanipulation/ReverseBits.java

@@ -17,4 +17,4 @@ public class ReverseBits {
         }
         return result;
     }
-}
+}

src/main/java/com/thealgorithms/datastructures/heaps/LeftistHeap.java

@@ -111,4 +111,4 @@ public class LeftistHeap {
         lst.add(n.element);
         in_order_aux(n.right, lst);
     }
-}
+}

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

@@ -109,4 +109,4 @@ public class Fibonacci {
         int nthTerm = (int) ((Math.pow(phi, n) - Math.pow(-phi, -n)) / squareRootOf5);
         return nthTerm;
     }
-}
+}

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

@@ -126,4 +126,4 @@ public class OptimalJobScheduling {
     public int getCost(int process, int machine) {
         return Cost[process][machine];
     }
-}
+}

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

@@ -17,4 +17,4 @@ public class PowerUsingRecursion {
         // Recurse with a smaller exponent and multiply with base
         return base * power(base, exponent - 1);
     }
-}
+}

src/main/java/com/thealgorithms/scheduling/PreemptivePriorityScheduling.java

@@ -51,4 +51,4 @@ public class PreemptivePriorityScheduling {
 
         return ganttChart;
     }
-}
+}

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

@@ -103,4 +103,4 @@ public class DualPivotQuickSort implements SortAlgorithm {
     /*
      * References: https://www.geeksforgeeks.org/dual-pivot-quicksort/
      */
-}
+}

src/main/java/com/thealgorithms/strings/StringCompression.java

@@ -58,4 +58,4 @@ public class StringCompression {
         }
         return res;
     }
-}
+}