QS

void Sort(int li, int ls, int v[])
{
	int min, max, m, temp;
	min = li;
	max = ls;
	m = v[(li + ls) / 2];
	while (min <= max)
	{
		while (v[min] < m)
			min++;
		while (v[max] > m)
			max--;
		if (min <= max)
		{
			temp = v[min];
			v[min++] = v[max];
			v[max--] = temp;
		};
	};
	if (li < max)
		Sort(li, max, v);
	if (ls > min)
		Sort(min, ls, v);
};