常用内部排序的实现

/**归并排序，改写自《数据结构C语言版》，P284*/#include <iostream>#define LENGTH 20using namespace std;void output(int* a, int len){int i;for (i = 0; i < len; i++)cout << a[i] << " ";cout << endl;}//将a[i..m]到a[m+1..n]归并到b[i..n]void Merge(int* a, int* b, int i, int m, int n){int j,k;for (j=m+1, k=i; i<=m && j<=n; k++){if (a[i] < a[j])b[k] = a[i++];elseb[k] = a[j++];}while (i <= m)b[k++] = a[i++];while (j <= n)b[k++] = a[j++];return;}//将a[s..t]归并排序为b[s..t]void MSort(int* a, int* b, int s, int t){if (s == t)b[s] = a[s];else{int tmp[LENGTH];int m = (s+t)/2;MSort(a, tmp, s, m);//递归将a[s..m]归并为有序的tmp[s..m]MSort(a, tmp, m+1, t);Merge(tmp, b, s, m, t);//将tmp[s..m]和tmp[m+1..t]归并到b[s..t]}return;}void MergeSort(int* a, int len){MSort(a, a, 0, len-1);return;}int main(int argc, char* argv[]){int a[LENGTH];int i;srand(time(NULL));for (i = 0; i < LENGTH; i++)a[i] = rand() % LENGTH;cout << "排序前：" << endl;i = LENGTH;output(a, i);MergeSort(a, i);cout << "排序后：" << endl;output(a, i);return 0;}/********************************************************************//**直接插入排序，改写自《数据结构C语言版》，P265*/#include <iostream>using namespace std;void InsertSort(int* a, int len){for (int i = 1; i < len; i++){if (a[i] < a[i-1]){int key = a[i];int j;for (j = i-1; j>=0 && a[j]>key; j--)a[j+1] = a[j];a[j+1] = key;}}return;}int main(){int a[] = {49,38,65,97,76,13,27,49};int n = sizeof(a)/sizeof(a[0]);InsertSort(a, n);for(int i = 0; i < n; i++)cout << a[i] << " ";cout << endl;return 0;}/********************************************************************//**折半插入排序，改写自《数据结构C语言版》，P267*/#include <iostream>#define LENGTH 20using namespace std;void zhebancharu(int* a, int len){int i,j;int low,high,m;for (i = 2; i <= len; i++){a[0] = a[i];low = 1;high = i-1;while (low <= high){m = (low+high)/2;if (a[0] > a[m])low = m+1;else high = m-1;}for (j = i; j > high+1; j--)a[j] = a[j-1];a[j] = a[0];}return;}void output(int* a, int len){int i;for (i = 1; i <= len; i++)cout << a[i] << " ";cout << endl;}int main(int argc, char* argv[]){int a[LENGTH];int i;srand(time(NULL));a[0] = LENGTH;for (i = 1; i <= LENGTH; i++)a[i] = rand() % LENGTH;cout << "排序前：" << endl;i = LENGTH;output(a, i);zhebancharu(a, i);cout << "排序后：" << endl;output(a, i);return 0;}/********************************************************************//**简单选择排序*/#include <iostream>#define LENGTH 20using namespace std;int SelectMinKey(int* a, int start, int len){int i,j,min;min = a[start];j = start;for (i = start+1; i < len; i++){if (a[i] < min){j = i;min = a[i];}}return j;}int SimpleSelection(int* a, int len){int i,j,tmp;for (i = 0; i < len; i++){j = SelectMinKey(a, i, len);//每次选择最小的元素放到前面的位置if (i != j){tmp = a[i];a[i] = a[j];a[j] = tmp;}}return 0;}void output(int* a, int len){int i;for (i = 0; i < len; i++)cout << a[i] << " ";cout << endl;}int main(int argc, char* argv[]){int a[LENGTH];int i;srand(time(NULL));a[0] = LENGTH;for (i = 0; i < LENGTH; i++)a[i] = rand() % LENGTH;cout << "排序前：" << endl;i = LENGTH;output(a, i);SimpleSelection(a, i);cout << "排序后：" << endl;output(a, i);return 0;}/********************************************************************//**希尔排序*/#include <iostream>using namespace std;void ShellSort(int* a, int len, int dk){for (int i = dk; i < len; i+=dk){if (a[i] < a[i-dk]){int key = a[i];int j;for (j = i-dk; j>=0 && a[j]>key; j-=dk)a[j+dk] = a[j];a[j+dk] = key;}}return;}int main(){int a[] = {49,38,65,97,76,13,27,49};int n = sizeof(a)/sizeof(a[0]);int dlta[] = {5,3,1};int i;for (i = 0; i < 3; i++)ShellSort(a, n, dlta[i]);for(i = 0; i < n; i++)cout << a[i] << " ";cout << endl;return 0;}/********************************************************************//**快速排序，改写自《数据结构C语言版》，P275*/#include <iostream>#define LENGTH 20using namespace std;//一趟快排过程：按照关键字分成两段int Partition(int* a, int low, int high){//a[0] = a[low];int pivotkey = a[low];while (low < high){while (low<high && a[high]>=pivotkey)high--;a[low] = a[high];while (low<high && a[low]<=pivotkey)low++;a[high] = a[low];}a[low] = pivotkey;return low;}void QuickSort(int* a, int low, int high){if (low < high){int pivotloc = Partition(a, low, high);//if (pivotloc>low && pivotloc<high)QuickSort(a, low, pivotloc-1);QuickSort(a, pivotloc+1, high);}return;}void QSort(int* a, int len){QuickSort(a, 0, len-1);return;}void output(int* a, int len){int i;for (i = 0; i < len; i++)cout << a[i] << " ";cout << endl;}int main(int argc, char* argv[]){int a[LENGTH];int i;srand(time(NULL));//a[0] = LENGTH;for (i = 0; i < LENGTH; i++)a[i] = rand() % LENGTH;cout << "排序前：" << endl;i = LENGTH;output(a, i);QSort(a, i);cout << "排序后：" << endl;output(a, i);return 0;}/********************************************************************//**冒泡排序*/#include <iostream>#define LENGTH 20using namespace std;int bubble(int* a, int len){int i,j,tmp;for (i = len-1; i >= 0; i--){for (j = 0; j <= i-1; j++)//每一趟有一块最大的石头沉到水底{if (a[j] > a[j+1]){tmp = a[j];a[j] = a[j+1];a[j+1] = tmp;}}}return 0;}void output(int* a, int len){int i;for (i = 0; i < len; i++)cout << a[i] << " ";cout << endl;}int main(int argc, char* argv[]){int a[LENGTH];int i;srand(time(NULL));a[0] = LENGTH;for (i = 0; i < LENGTH; i++)a[i] = rand() % LENGTH;cout << "排序前：" << endl;i = LENGTH;output(a, i);bubble(a, i);cout << "排序后：" << endl;output(a, i);return 0;}/********************************************************************//**改写自《数据结构C语言版》，P282*/#include <iostream>#define LENGTH 20using namespace std;void output(int* a, int len){int i;for (i = 1; i <= len; i++)cout << a[i] << " ";cout << endl;}//已知序列中记录的关键字除a[s]之外的均满足堆的定义,本函数调整a[s]的关键字，使a[s..m]成为一个大顶堆void HeapAdjust(int* a, int s, int m){int j;int rc = a[s];for (j = 2*s; j <= m; j *= 2){if (j<m && a[j]<a[j+1])j++;//较大的孩子if (rc >= a[j])break;a[s] = a[j];s = j;}a[s] = rc;return;}void HeapSort(int* a, int len){int i,tmp;for (i = len/2; i > 0; i--)HeapAdjust(a, i, len);//把a[1..len]建立成大顶堆cout << "原始堆序列：" << endl;output(a, len);for (i = len; i > 1; i--){tmp = a[1];//每次把顶部的最大元素交换到底部a[1] = a[i];a[i] = tmp;HeapAdjust(a, 1, i-1);}return;}int main(int argc, char* argv[]){int a[LENGTH];int i;srand(time(NULL));a[0] = LENGTH;for (i = 1; i <= LENGTH; i++)a[i] = rand() % LENGTH;cout << "无序序列：" << endl;i = LENGTH;output(a, i);HeapSort(a, i);//大顶堆排序完成后，序列由小到大排列;反之亦然cout << "排序后：" << endl;output(a, i);return 0;}