- 博客(3)
- 收藏
- 关注
RSS订阅原创 bubble sort
#include#define N 10int source[N] = {1,5,3,2,7,9,4,10,6,8};int main(){int j;for(j=1;j < N;j++){ int i = j - 1; int key = s
2011-07-12 14:36:53
236
原创 merge sort
//Merge sort BY ZHAODW#include#define N 10#define SENTINEL 1000int source[N] = {1,9,2,8,3,7,4,6,5,10};int L[N] = {0};int R[N] = {0};
2011-07-12 14:18:06
268
原创 insert sort
#include#define N 10int source[N] = {1,5,3,2,7,9,4,10,6,8};int main(){int j;for(j=1;j < N;j++){ int i = j - 1; int key = s
2011-07-12 13:12:25
258
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人