microlyc的博客

非递归实现： #include #define N 7 #define M 3 int main() { int array[N] = { 1,2,3,4,5,6 ,7 }; int i, j, k; for (i = 0; i<=N-M; i++) for (j = i + 1; j<=N-M+1; j++) for (k = j + 1; k<=N-M+2;

void bubblesort(int m[], int n) { int i, j; bool flag = true; for (i = 0; i < n - 1 && flag; ++i) { flag = false; for (j = n - 2; j >= i; --j) { if (m[j] < m[j + 1]) { swap(m[j], m[j + 1

一步一图一代码，一定要让你真正彻底明白红黑树   作者：July   二零一一年一月九日 http://my.youkuaiyun.com/v_JULY_v ----------------------------- 本文参考： I、  The Art of Computer Programming Volume I II、 Introduction to Algorithm

#include #include using namespace std; const int maxn = 110; int merge(int a[], int left1, int right1, int l2,int r2) { int i = left1, j = l2; int temp[maxn], index = 0; while (i<=right1 && j<=r2)

#include #include using namespace std; int partition(int A[], int left, int right) { int m = left + (right - left) / 2; if (A[left] > A[right]) swap(A[left], A[right]); if (A[m] > A[right]) swa