七种排序算法*

冒泡排序

void maopao(int *a, int n)
{
for (int i = 0; i < n - 1; ++i)
for (int j = 0; j < n - 1 - i; ++j)
if (a[j]>a[j + 1])
swap(a[j], a[j + 1]);
}

选择排序

void SelectSort(int *a, int len){
for (int i = 0; i < len; ++i)
{
int k = i;
int min = a[i];
for (int j = i + 1; j < len; ++j)
{
if (a[j] < min)
{
min = a[j];
k = j;
}
}
if (k!=i)
swap(a[i], a[k]);
}

｝

插入排序

void InsertSort(int *a, int len){
for (int j = 1; j < len; ++j){
int key = a[j];
int i = j - 1;
while (i >= 0 && key < a[i])
{
a[i + 1] = a[i];
--i;
}
a[i+1] = key;
}
}

希尔排序

void ShellSort(int *a, int n)
{
int gap;
for (gap =n/2; gap >0; gap/=2)
{
for (int i = 0; i<gap; i++)
{
for (int j = i + gap; j < n;j+=gap){
int key = a[j];
int i = j - gap;
while (i >= 0 && key < a[i])
{
a[i + gap] = a[i];
i-=gap;
}
a[i + gap] = key;
}
}
}
}

快速排序

void QuickSort(int *a,int start,int end){
int key, i, j;
if (start >= end)
return;
key = a[start];
i = start;
j = end;
while (i != j){
while (a[j] >= key&&i < j)
--j;
while (a[i] <= key&&i < j)
++i;
if (i < j)
swap(a[i], a[j]);
}
swap(a[start], a[i]);
QuickSort(a, start, i-1);
QuickSort(a, i+1, end);
}

归并排序

void Merge(int *a,int *b,int start,int mid,int end){
int i = start;
int j = mid + 1;
int k = start;
while (i != mid + 1 && j != end + 1)
{
if (a[i] > a[j])
b[k++] = a[j++];
else
b[k++] = a[i++];
}
while (i != mid + 1)
b[k++] = a[i++];
while (j != end + 1)
b[k++] = a[j++];
for ( i = start; i <= end; ++i)
a[i] = b[i];
}
void MergeSort(int *a,int *b,int start,int end){
int mid = (start + end) / 2;
if (start < end)
{
MergeSort(a, b, start, mid);
MergeSort(a, b, mid + 1, end);
Merge(a, b, start, mid, end);
}
}

堆排序 

void HeapAdjust(int *a, int i, int nLength)
{
int nChild;
    for (; 2 * i + 1<nLength; i = nChild)
{
nChild = 2 * i + 1;
if (nChild<nLength - 1 && a[nChild + 1]>a[nChild])
++nChild;
if (a[i]<a[nChild])
   swap(a[i], a[nChild]);
else break; 
}
}
void HeapSort(int *a, int length)
{
int i;
    for (i = length / 2 - 1; i >= 0; --i)//构建大顶堆
HeapAdjust(a, i, length);
for (i = length - 1; i>0; --i)
{
swap(a[0], a[i]);//将堆顶元素移到最后
HeapAdjust(a, 0, i);//维持大顶堆特性
}
}