Dutor

#include <iostream>
#include <algorithm>
#include <ctime>
 
using namespace std;
 
class quick_sort
{
public:
	typedef int T;
	explicit quick_sort(T* src, int beg, int end);
private:
	void sub_sort(int beg, int end);
	T* m_src;
};
 
quick_sort::quick_sort(quick_sort::T *src, int beg, int end):m_src(src)
{
	srand(time(0));
	sub_sort(beg, end);
}
void quick_sort::sub_sort(int beg, int end)
{
	int i = beg - 1, j = end;
	if(end <= beg)
		return;
	T piv = m_src[rand()%(end-beg) + beg];
	for( ; ; )
	{
		while(m_src[++i] < piv);
		while(piv < m_src[--j]);
		if ( i >= j)
			break;
		swap(m_src[i], m_src[j]);
	}
	sub_sort(beg, i);
	sub_sort(i+1, end);
}
 
 
int main()
{
	const int n = 20;
	int src[n];
	for(int i = 0; i < n; ++i)
	{
		src[i] = n - i;
	}
	quick_sort(src, 0, n);
	for(int i = 0; i < n; ++i)
	{
		cout<<src[i]<<endl;
	}
	//system("pause");
	return 0;
}