Cleaned and formatted code

Toppmote · Toppmote · commit bd75a504a7e0 · 2022-01-22T02:27:51.000+07:00
diff --git a/src/main/java/ru/algorithms/MergeSort.java b/src/main/java/ru/algorithms/MergeSort.java
@@ -41,20 +41,23 @@ private void mergeSort(T[] array, int left, int right) {
         merge(array, left, middle, right);
     }
 
+    /**
+     * Procedure of merging 2 arrays
+     *
+     * @param array  array (contains 2 arrays)
+     * @param left   left index (beginning of first array)
+     * @param middle middle index
+     * @param right  right index (end of second array)
+     */
     private void merge(T[] array, int left, int middle, int right) {
         int leftLength = middle - left + 1;
         int rightLength = right - middle;
         T[] leftArr = Arrays.copyOfRange(array, left, middle + 1);
         T[] rightArr = Arrays.copyOfRange(array, middle + 1, right + 1);
         int i = 0, j = 0;
         int k = left;
-        while (i < leftLength && j < rightLength) {
+        while (i < leftLength && j < rightLength)
             array[k++] = leftArr[i].doubleValue() <= rightArr[j].doubleValue() ? leftArr[i++] : rightArr[j++];
-//            if (leftArr[i].doubleValue() <= rightArr[j].doubleValue())
-//                array[k++] = leftArr[i++];
-//            else
-//                array[k++] = rightArr[j++];
-        }
         while (i < leftLength)
             array[k++] = leftArr[i++];
         while (j < rightLength)
diff --git a/src/main/java/ru/algorithms/SelectionSort.java b/src/main/java/ru/algorithms/SelectionSort.java
@@ -7,7 +7,7 @@
  * Worst time: 0(n^2)
  * Average time: 0(n^2)
  * Best time: 0(n^2)
- *
+ * <p>
  * Memory cost: 0(1)
  *
  * @param <T> Data type of array elements

Original file line number	Diff line number	Diff line change
`@@ -7,7 +7,7 @@`
`7`	`7`	`* Worst time: 0(n^2)`
`8`	`8`	`* Average time: 0(n^2)`
`9`	`9`	`* Best time: 0(n^2)`
`10`		`- *`
	`10`	`+ * <p>`
`11`	`11`	`* Memory cost: 0(1)`
`12`	`12`	`*`
`13`	`13`	`* @param <T> Data type of array elements`