快速排序

顺便安利一波学习数据结构&&算法的好地方：VisuAlgo

#include<iostream>
using namespace std;

int partition(int a[], int i, int j)
{
	int p = a[i];
	int m = i;
	for (int k = i + 1; k <= j; k++)
	{
		if (a[k] < p)
		{
			m++;
			swap(a[m], a[k]);
		}
	}
	swap(a[i], a[m]);
	return m;
}

void quickSort(int a[], int low, int high)
{
	if (low < high)
	{
		int m = partition(a, low, high);
		quickSort(a, low, m - 1);
		quickSort(a, m + 1, high);
	}
}
int main()
{

	int arr[5] = { 2,1,3,4,6 };
	quickSort(arr, 0, 4);

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


	system("pause");
	return 0;
}