Quick_Sort

贴在这里，省得以后又忘。

#include "stdafx.h"

#include <iostream>

using namespace std;

void quick_sort(int ray[],int left, int right)

{

int pivot = ray[right];

int less = left;

for(int i = left; i < right; i++)

{

if(ray[i] <= pivot)//swap ray[less] and ray[less];

{

int temp = ray[less];

ray[less] = ray[i];

ray[i] = temp;

less++;

}

}

int temp = ray[less];

ray[less] = ray[right];

ray[right] = temp;

if(left <= less-1)

quick_sort(ray, left, less-1);

if(less+1 <= right)

quick_sort(ray, less+1, right);

}

int _tmain(int argc, _TCHAR* argv[])

{

int ray[] = {5,7,4,4,2,9,9};

quick_sort(ray, 0, 6);

for(int i = 0; i != 7; i++)

{

cout << ray[i] << endl;

}

return 0;

}