摘要： /* * description: 归并排序示例 * writeby: nick * date: 2012-10-23 16:35 * */#include <iostream>#define maxN 10using namespace std;template <class Item>void merge(Item a[], int l, int m, int r){ int i,j; Item tmp[maxN]; for(i=l; i<=m; i++) tmp[i] = a[i]; // / fo... 阅读全文

摘要： /* * description: 快速排序示例 * writeby: nick * date: 2012-10-23 16:16 * */#include <iostream>#include <stack>using namespace std;//递归版本void quicksort(int a[], int l, int r){ int mid = a[(l+r) / 2]; int lwalker = l, rwalker = r; while(lwalker < rwalker) { w... 阅读全文

摘要： /* * description: 快速排序示例 * writeby: nick * date: 2012-10-23 16:16 * */#include <iostream>using namespace std;void quicksort(int a[], int l, int r){ int mid = a[(l+r) / 2]; int lwalker = l, rwalker = r; while(lwalker < rwalker) { while(a[lwalker] < mid)... 阅读全文