快速排序

一个简单的快速排序实现。其中，对比的节点为第一个结点。

#include<iostream>
#include<cstdlib>
#include<ctime>
#define VectorMax 100
using namespace std;
int vector[VectorMax];        /* * * sort vec * length is vec's length * flag == 0, increase; * flag == 1, decrease * */
void myqsort(int *vec, int length);
void print(int *vec, int length);
int main()
{
    srand(time(NULL));
    for (int i = 0; i < VectorMax; i++)
        vector[i] = rand() % 100;
    myqsort(vector, VectorMax);
    print(vector, VectorMax);
    return 0;
}
/*sort vec[begin, end) */

void subSort(int *vec, int begin, int end)
{
    int Tag = vec[begin];
    int Begin = begin;
    int End = end - 1;
    while (Begin < End) {
        while (vec[End] > Tag && Begin < End)
            End--;
        vec[Begin] = Begin < End ? vec[End] : vec[Begin];
        while (vec[Begin] <= Tag && Begin < End)
            Begin++;
        vec[End] = Begin < End ? vec[Begin] : vec[End];
    }
    vec[Begin] = Tag;
    if (Begin - begin > 1)
        subSort(vec, begin, Begin);
    if (end - Begin > 1)
        subSort(vec, Begin + 1, end);
}

void myqsort(int *vec, int length)
{
    subSort(vec, 0, length);
} 
void print(int *vec, int length)
{
    for (int i = 0; i < length; i++)
        cout << vec[i] << " ";
    cout << endl;
}