摘要：
void Merge(int *a, int ileft, int imid, int iright) //辅助函数{ int n1 = imid - ileft + 1; int n2 = iright - imid; int *Larray = new int[n1]; int *Rarra... 阅读全文
摘要：
/***************插入排序算法**********/void InsertSort(int *a, int len){ for(int j = 1; j =0 && a[i]>key) { a[i+1] = a[i]; i--; } a[i+1] = key; }}/*********... 阅读全文