Sort

//============================================================================
// Name        : Qsort.cpp
// Author      : 
// Version     :
// Copyright   : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================

#include <ctime>
#include <cstdlib>
#include <iostream>
using namespace std;

void Bubble(int s[], int len)
{
    bool flag = true;
    for(int i = len; i > 0 && flag; i--)
    {
        flag = false;
        for(int j = 0; j < i; j++)
        {
            if(s[j] > s[j+1])
            {
                int temp = s[j];
                s[j] = s[j+1];
                s[j+1] = temp;
                flag = true;
            }
        }
    }
}

void Chose(int s[], int len)
{
    for(int i = 0; i < len; i++)
    {
        int min = i;
        for(int j = i + 1; j < len; j++)
            if(s[min] > s[j])
                min = j;
        int temp = s[min];
        s[min] = s[i];
        s[i] = temp;
    }
}

void Insert(int s[], int len)
{
    for(int i = 1; i < len; i++)
    {
        if(s[i-1] > s[i])
        {
            int j, temp = s[i];
            for(j = i -1; j >= 0 && s[j] > temp; j--)
            {
                s[j+1] = s[j];
            }
            s[j+1] = temp;
        }
    }
}

void Shell(int s[], int len)
{
    int step = len/2;
    while(step >= 1)
    {
        for(int i = step; i < len; i ++)
        {
            if(s[i-step] > s[i])
            {
                int j, temp = s[i];
                for(j = i - step; j >= 0 && s[j] > temp; j = j - step)
                {
                    s[j+step] = s[j];
                }
                s[j+step] = temp;
            }
        }
        step = step/2;
    }
}

void HeapAdj(int s[], int i, int len)
{
    int child;
    for(; 2*i+1 < len; i = child)
    {
        child = 2*i+1;
        if(child+1 < len && s[child] < s[child+1])
            child++;
        if(s[i] < s[child])
        {
            int temp = s[i];
            s[i] = s[child];
            s[child] = temp;
        }
    }
}

void Heap(int s[], int len)
{
    for(int i = len/2 - 1; i >= 0; i--)
        HeapAdj(s, i, len);
    for(int i = len - 1; i > 0; i--)
    {
        int temp = s[0];
        s[0] = s[i];
        s[i] = temp;
        HeapAdj(s, 0, i);
    }
}

void MergeFun(int s[],int t[], int m, int n)
{
    if(m == n)
        return;
    int mid = (n+m)/2;
    MergeFun(s, t, m, mid);
    MergeFun(s, t, mid+1, n);
    int k = m, a = m, b = mid+1;
    while(a <= mid && b <= n)
    {
        while(s[a] <= s[b] && a <= mid)
            t[k++] = s[a++];
        while(s[b] <= s[a] && b <= n)
            t[k++] = s[b++];
    }
    if(b == n+1)
    {
        while(k <= n)
            t[k++] = s[a++];
        for(k = m; k <= n; k++)
            s[k] = t[k];
    }
    else
    {
        for(int i = m; i < k; i++)
            s[i] = t[i];
    }
}

void Merge(int s[], int len)
{
    int *t = new int[len];
    MergeFun(s, t, 0, len-1);
}

void QuitFun(int s[], int low, int high)
{
    if(low >= high)
        return;

    int p = s[low];
    int l = low, h = high;
    while(l < h)
    {
        while(s[h] >= p && l < h)
            h--;
        int temp = s[h];
        s[h] = s[l];
        s[l] = temp;
        while(p >= s[l] && l < h)
            l++;
        temp = s[h];
        s[h] = s[l];
        s[l] = temp;
    }
    QuitFun(s, low, l);
    QuitFun(s, l+1, high);
}

void Quit(int s[], int len)
{
    QuitFun(s, 0, len-1);
}

clock_t start, stop;

#define LEN 30000
int num[LEN];
int main() {
    srand(time(NULL));
    for(int i = 0; i < LEN; i++)
    {
        //num[i] = rand()%LEN;
        num[i] = LEN - i;
    }

    start = clock();
    Merge(num, LEN);
    stop = clock();
    cout<<"time : "<< stop - start << endl;

    for(int i = 0; i < LEN - 1; i++)
    {
        if(num[i] > num[i+1])
            cout<<"error"<<endl;
    }
    cout<<"done"<<endl;
    return 0;
}