Merge pull request TheAlgorithms#1279 from littleFoot1/master

StepfenShawn · web-flow · commit 0389d31b942e · 2020-04-17T01:46:42.000-05:00
I find a problem
diff --git a/Sorts/ShellSort.java b/Sorts/ShellSort.java
@@ -22,10 +22,11 @@ public <T extends Comparable<T>> T[] sort(T[] array) {
         for (; gap > 0; gap /= 3) {
             for (int i = gap; i < length; i++) {
                 int j;
-                for (j = i; j >= gap && less(array[j], array[j - gap]); j -= gap) {
+		T temp = array[i];
+                for (j = i; j >= gap && less(temp, array[j - gap]); j -= gap) {
                     array[j] = array[j - gap];
                 }
-                array[j] = array[i];
+                array[j] = temp;
             }
         }
         return array;

Original file line number	Diff line number	Diff line change
`@@ -22,10 +22,11 @@ public <T extends Comparable<T>> T[] sort(T[] array) {`
`22`	`22`	`for (; gap > 0; gap /= 3) {`
`23`	`23`	`for (int i = gap; i < length; i++) {`
`24`	`24`	`int j;`
`25`		`- for (j = i; j >= gap && less(array[j], array[j - gap]); j -= gap) {`
	`25`	`+ T temp = array[i];`
	`26`	`+ for (j = i; j >= gap && less(temp, array[j - gap]); j -= gap) {`
`26`	`27`	`array[j] = array[j - gap];`
`27`	`28`	`}`
`28`		`- array[j] = array[i];`
	`29`	`+ array[j] = temp;`
`29`	`30`	`}`
`30`	`31`	`}`
`31`	`32`	`return array;`