快速排序

#include <iostream>
#include <stdio.h>
#include <time.h>

using namespace std;

int myrand(int low , int high){
    return (rand()%(high - low))+low;
}

template<typename T>
void quicksort(T * array,int low,int high){
    if( low < high){

    int x = array[myrand(low,high)];
    int i = low,j = high;

    while( i < j){
        // 从左往右找到大于x的数
        while(i < j && array[i] < x)   
            i++;    
        // 从右往左找到小于x的数
        while(i < j && array[j] > x)  
            j--;    
        //如果i<j就交换值
        if(i < j)   
            swap(array[i],array[j]);
    }

    quicksort(array,low,i - 1);
    quicksort(array,i+1,high);
    }
}


int main(){
    srand(unsigned int(time(NULL)));

    int array[10];
    for(int i = 0;i<10;i++)
        array[i] = myrand(0,100);
    for(auto& elem : array)
        cout << elem << " ";
    cout << endl;

    quicksort(array,0,9);
    for(auto& elem : array)
        cout << elem << " ";
    cout << endl;


    system("pause");

    return 0;
}