希尔排序

#include<iostream>
using namespace std;
void shellsort(int arr[], int len) {
    int i, j, h, temp;
    for (h = len / 2; h >0; h = h / 2) {
        for (i = h; i < len; i++) {
            temp = arr[i];
            for (j = i - h; j >= 0; j -= h) {
                if (temp < arr[j]) arr[j + h] = arr[j];
                else break;
            }
            arr[j + h] = temp;
        }
    }

}
int main(){
    int a[] = {5,4,9,8,7,6,0,1,3,2};
    int len = sizeof(a) / sizeof(a[0]);
    shellsort(a, len);
    for (int i = 0; i < len; i++) {
        cout << a[i] << " ";
    }
    cout << endl;
    return 0;
}