失败-希尔排序

Posted 2021-04-02 霍同学笔记

#include<stdio.h>
void shellsort(int arr[], int length){ int increment = length; int i, j; do { increment = increment / 2 + 1;
 for (i = increment; i <= length; i++) {
 if (arr[i] < arr[i - increment]) { int temp = arr[i]; for (j = i - increment; j >= 0 && temp < arr[j]; j -= increment) { arr[j + increment] = arr[j]; } arr[j + increment] = temp; } } } while (increment > 1);}
int main(){ int arr[6] = { 12,1,8,6,4,5 }; shellsort(arr, 6); int i; for (i = 0; i < 6; i++) printf(" %d ", arr[i]); return 0;}

失败了 ，重新学