Function ShellSort

CPP/sorting/shellsort.cpp:10–23

  * y = temp;
}
void ShellSort(int A[], int n) {
  int gap, i, j, temp;
  for (gap = n / 2; gap >= 1; gap /= 2) {
    for (i = gap; i < n; i++) {
      temp = A[i];
      j = i - gap;
      while (j >= 0 && A[j] > temp) {
        A[j + gap] = A[j];
        j = j - gap;
      }
      A[j + gap] = temp;
    }
  }
}
int main() {
  int A[] = {11,13,7,12,16,9,24,5,10,3}, n = 10, i;
  SellSort(A, n);