- #include <stdio.h>
- #include <stdlib.h>
- int insertSort(int a[], int len)
- {
- int j,p;
- int tmp;
- for(j = 0; j < len; j++)
- {
- tmp = a[j];
- for(p=j; p > 0 && a[p - 1] < tmp; p--)
- {
- a[p] = a[p - 1];
- }
- a[p] = tmp;
- }
- return 0;
- }
- int main(void)
- {
- int i;
- int t[] = {1033, 324, 3333, 44444, 222222, 55555, 22233344};
- insertSort(t, sizeof(t) / sizeof(int));
- for(i = 0; i < sizeof(t)/sizeof(int); i++)
- {
- printf("%d of t is %d/n", i, t[i]);
- }
- return 0;
- }
简单的记录一些算法,方便自己查找