1 /*
2 insertion sort
3 */
4
5 #include<stdio.h>
6
7 void InsertionSort(int A[], int N)
8 {
9 int j, p;
10 //ElementType Tmp;
11 int Tmp;
12 for(p = 1; p < N; p++){
13 Tmp = A[p];
14 for(j = p; j > 0 && A[j - 1] > Tmp; j--)
15 A[j] = A[j - 1];
16 A[j] = Tmp;
17 }
18 }
19 int main()
20 {
21 int array[] = {3,54,7,99,21,6,23,1};
22 int i, num;
23 num = sizeof(array) / sizeof(int);
24 printf("num = %d\n", num);
25 InsertionSort(array, num);
26 for(i = 0; i < num; i++)
27 printf("array[%d] = %d\n", i, array[i]);
28 return 0;
29 }
时间复杂度:O(n*lgn)
最坏:O(n^2)
空间复杂度:O(n*lgn)
不稳定。
快速排序是一种排序算法,对包含n个数的输入数组,平均时间为O(nlgn),最坏情况是O(n^2)。
通常是用于排序的最佳选择。因为,基于比较的排序,最快也只能达到O(nlgn)。
已下是gdb调试的一些信息,供参考。
(gdb) print array
$1 = {3, 54, 7, 99, 21, 6, 23, 1}
Breakpoint 3, InsertionSort (A=0x7ffffffa1bf0, N=8) at insert_sort.c:12
12 for(p = 1; p < N; p++){
(gdb) print A
$5 = (int *) 0x7ffffffa1bf0
(gdb) print *A
$6 = 3
(gdb) print *A+1
$7 = 4
(gdb) print *(A+7)
$9 = 1
(gdb) print *(A+1)
$10 = 54
数组和指针实际意义:
Breakpoint 4, InsertionSort (A=0x7ffffffa1bf0, N=8) at insert_sort.c:14
14 for(j = p; j > 0 && A[j - 1] > Tmp; j--)
(gdb) print A[0]
$19 = 3
(gdb) print A[1]
$20 = 54
(gdb) print A[2]
$21 = 7
(gdb) print *A
$22 = 3
(gdb) print *(A+1)
$23 = 54
(gdb) print *(A+2)
$24 = 7
结果:
Breakpoint 4, InsertionSort (A=0x7ffffffa1bf0, N=8) at insert_sort.c:14
14 for(j = p; j > 0 && A[j - 1] > Tmp; j--)
(gdb)
Continuing.
array[0] = 1
array[1] = 3
array[2] = 6
array[3] = 7
array[4] = 21
array[5] = 23
array[6] = 54
array[7] = 99
Program exited normally.