摘要:
void sort(int data[], int N){ for(int i = 1; i < N; i++){ int max = 0; int maxIndex = 0; for(int j = i; j <= N; j++){ if(max < data[j]) { max =... 阅读全文
posted @ 2016-11-15 17:52
Pumpkin0227
阅读(134)
评论(0)
推荐(0)
摘要:
#define SIZE 20 int partition(int l, int r, int data[SIZE]) { int v = data[r]; int i = l - 1; int j = r; while(1){ while(data[++i] < v); while(v < data[--j]) if(j ==... 阅读全文
posted @ 2016-11-15 17:51
Pumpkin0227
阅读(155)
评论(0)
推荐(0)
摘要:
题目: 求ABCDEF全排列的输出(DFS,深度优先算法) 2016-11-15 阅读全文
posted @ 2016-11-15 17:47
Pumpkin0227
阅读(254)
评论(0)
推荐(0)

浙公网安备 33010602011771号