CSDN515的专栏

//归并排序//归并排序算法是一种O(nlogn)的算法。它的最差，平均，最好时间都是O(nlogn)。//但是它需要额外的存储空间，这在某些内存紧张的机器上会受到限制。#include #includeusing namespace std;int a[10]={23,443,534,12,312,3,14,32,34,23};void merge(int fir,int end

#includeint a[12]={23,34,12,31,23,134,12,432,4,12,3123,12};//获取a[low]值该放置的位置（从小到大）int FindPos(int low,int high){ int val = a[low]; while(low<high) { while(val<=a[high] && low<high) high

//希尔排序算法#include #includeusing namespace std;int data[] = { 23, 34, 523, 421, 31, 3465, 4, 2341 };const int n = sizeof(data) / sizeof(int);//希尔排序//取间隔d的数进行排序，然后缩小d的范围，直到d<=0,d的范围取值d=(d+1)/2;

//冒泡排序#include #includeusing namespace std;int a[10] = {45,34,2,65,987,0,67,45,2,45};int len = sizeof(a)/sizeof(int);void BubbkeSort(){ int i,j,temp; for(i=0;i<len-1;i++) {

//选择排序#include #includeusing namespace std;int a[10] = {45,34,2,65,987,0,67,45,2,45};int len = sizeof(a)/sizeof(int);void SelectSort(){ int i,j,temp,minVal; for(i=0;i<len-1;i++) {

//插入排序#include #includeusing namespace std;int arr[] = { 23, 34, 523, 421, 31, 3465, 4, 2341 };const int n = sizeof(arr) / sizeof(int);void InsertSort(){ for (int i = 1; i < n; i++)//