Update 4.shellSort.md (#36)

hoop208 · hustcc · commit 545fa6de16e7 · 2019-08-13T19:30:44.000+08:00
修正希尔排序java实现的gap计算
diff --git a/4.shellSort.md b/4.shellSort.md
@@ -99,7 +99,7 @@ public class ShellSort implements IArraySort {
         int[] arr = Arrays.copyOf(sourceArray, sourceArray.length);
 
         int gap = 1;
-        while (gap < arr.length) {
+        while (gap < arr.length/3) {
             gap = gap * 3 + 1;
         }
 

Original file line number	Diff line number	Diff line change
`@@ -99,7 +99,7 @@ public class ShellSort implements IArraySort {`
`99`	`99`	`int[] arr = Arrays.copyOf(sourceArray, sourceArray.length);`
`100`	`100`
`101`	`101`	`int gap = 1;`
`102`		`- while (gap < arr.length) {`
	`102`	`+ while (gap < arr.length/3) {`
`103`	`103`	`gap = gap * 3 + 1;`
`104`	`104`	`}`
`105`	`105`