![](https://img-blog.csdnimg.cn/20201014180756754.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
算法
程序猿_存储研发
勤奋好学
展开
-
【算法】插入排序 insert sort algorithm
voidmain() { int a[10] = {9, 8, 7, 6, 5, 4, 3, 2, 1, 0}; int key = 0; int j = 0; for (j = 1; j < sizeof(a)/sizeof(int); j++) { key = a[j];原创 2014-07-15 22:59:24 · 341 阅读 · 0 评论 -
【算法】归并排序 merge sort
#include #include #include int a[15] = {15,14,13,12,11,10, 9, 8, 7, 6, 5, 4, 3, 2, 1}; void merge_sort (int l_num, int h_num) { int k = l_num; int m = (h_num+l_num)/2+1; int i = 0; int *b = N原创 2014-07-17 23:01:33 · 615 阅读 · 0 评论