Merge pull request TheAlgorithms#1279 from littleFoot1/master

I find a problem

Author: StepfenShawn

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;