数据结构—快速排序

*快速排序

#include <iostream>
using namespace std;

const int N = 100;

void quick_sort(int *q, int begin, int tail)
{
    if(begin > tail)
        return;

    int tmp = q[begin];
    int i = begin;
    int j = tail;

    while(i != j)
    {
        while(q[j] >= tmp && j > i)
            j--;
        while(q[i] <= tmp && j > i)
            i++;
        if(i < j)
        {
            swap(q[i], q[j]);
        }
    }

    q[begin] = q[i];
    q[i] = tmp;

    quick_sort(q, begin, i-1);
    quick_sort(q, i+1, tail);
}


int main(void)
{
    int num = 0;
    int q[100];

    cout << "Please input the num_number: " << endl;
    cin >> num;

    for (int i = 0; i < num; i++)
    {
        cin >> q[i];
    }

    quick_sort(q, 0, num-1);

    for (int i = 0; i < num; i++)
    {
        cout << q[i] << " ";
    }

    return 0;
}