fix: logic changes

Author: Rosander0

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

@@ -17,8 +17,6 @@ private LibrarySort() {
         // Utility class
     }
 
-    private static final int GAP = 1;
-
     /**
      * Sorts an array using the Library Sort algorithm.
      *
@@ -34,30 +32,22 @@ public static int[] sort(final int[] array) {
         }
 
         int n = array.length;
-        // Allocate spaced array with gaps between each element
-        int spacedSize = n * (GAP + 1);
-        Integer[] spaced = new Integer[spacedSize];
+        Integer[] spaced = new Integer[2 * n];
 
-        // Insert first element
         spaced[0] = array[0];
-
         int inserted = 1;
 
         for (int i = 1; i < n; i++) {
-            // Binary search for correct position among inserted elements
             int pos = binarySearch(spaced, inserted, array[i]);
-
-            // Shift elements right by GAP+1 to make room
             for (int j = inserted; j > pos; j--) {
                 spaced[j] = spaced[j - 1];
             }
             spaced[pos] = array[i];
             inserted++;
         }
 
-        // Collect sorted elements back
         int idx = 0;
-        for (int i = 0; i < spacedSize; i++) {
+        for (int i = 0; i < 2 * n; i++) {
             if (spaced[i] != null) {
                 array[idx++] = spaced[i];
             }
@@ -78,7 +68,7 @@ private static int binarySearch(final Integer[] spaced, final int inserted, fina
         int hi = inserted;
         while (lo < hi) {
             int mid = lo + (hi - lo) / 2;
-            if (spaced[mid] != null && spaced[mid] <= target) {
+            if (spaced[mid] <= target) {
                 lo = mid + 1;
             } else {
                 hi = mid;