插入排序和希尔排序

希尔排序就是插入排序的优化 #include<stdio.h> #include<stdlib.h> void swap(int* a, int *b){ int tmp = *a; *a = *b; *b = tmp; } void Printf(int arr[], int size){ for (int i = 0; i < size; i++){ printf("%d ", a

>>阅读原文<<