Description: void insert_sort (int* a, int n) (if (n == 1) return insert_sort (a, n-1) int temp = a [n-1] for (int i = n-2 i> = 0 i--) (if (temp <a [i]) a [i+ 1] = a [i] else break) a [i+ 1] = temp)
To Search:
File list (Check if you may need any files):
插入法排序
..........\Debug
..........\插入法排序.cpp
..........\插入法排序.dsp
..........\插入法排序.dsw
..........\插入法排序.ncb
..........\插入法排序.opt
..........\插入法排序.plg
Download