堆排序和归并排序

堆排序：

首先输出堆顶的最大（或最小）元素，然后再使得剩余的n-1个元素组成一个新堆，从而得到次大值（或次小值）。依次类推。

//堆排序实现
#include<iostream>
#include<algorithm>
using namespace std;

void heapAjust(int a[], int i, int size)
{
     int lchild = 2 * i;
     int rchild = 2 * i + 1;
     int min = i;
     if (i <= size/2)
     {
           int min1;
           if (a[i] > a[lchild] && lchild <= size)
           min1 = lchild;
           else
           min1 = i;
           
           if (a[min1] > a[rchild] && rchild <= size)
           min = rchild;
           else
           min = min1;
           
           if (min != i)
           {
                   swap(a[i], a[min]);
                   heapAjust(a, min, size);
           }
     }
}

void buildheap(int a[], int size)
{
     for (int i = size/2; i >= 1; i--)
     {
         heapAjust(a, i, size);
     }
}

void show(int a[], int size)
{
     for (int i = 1; i < size; i++)
     {
         cout << a[i] << ends;
     }
     cout << endl;
}

void heapsort(int a[], int size)
{
     for (int i = size; i >= 1; i--)
     {
         swap(a[1], a[i]);
         heapAjust(a, 1, i - 1);
     }
}
int main()
{
    const int size = 7;
    int arry[size] = {0,6,5,1,9,2,4};
    buildheap(arry, size -1);
    show(arry, size);

    heapsort(arry, size - 1);
    show(arry, size);
    system("pause");
    return 0;  
}

归并排序：

用的是分治的思想，将两个或两个以上的有序表合成一个新的有序表的排序过程。

// merge sort 
#include<iostream>
using namespace std;

// r[s~m]  r[m+1~t]
void merge(int r[], int r1[], int s, int m, int t)
{
     int i = s;
     int j = m + 1;
     int k = s;
     while (i <= m && j <= t)
     {
           if (r[i] <= r[j])
           r1[s++] = r[i++];
           else
           r1[s++] = r[j++];
     }
     if (i <= m)
     {
           while (i <= m)
           {
                 r1[s++] = r[i++];
           }
     }
     else if (j <= t)
     {
          while (j <= t)
          {
                r1[s++] = r[j++];
          }
      }
}

void mergesort(int r[], int r1[], int s, int t)
{
     if (s == t) 
     r1[s] = r[s];
     
     else
     {
         int r2[100];
         int m = (s + t)/2;
         mergesort(r, r2, s, m);
         mergesort(r, r2, m+1, t);
         merge(r2, r1, s, m, t);
     }
}

int main()
{
    int r[100] = {2,3,8,5,6,32,65,87,12,9};
    int r1[100];
    int s = 0;
    int t = 9;
    mergesort(r, r1, s, t);
    for(int i = 0; i < t; i++)
    cout << r1[i] << ends;
    cout << ends;
    system("pause");
    return 0;
}