算法 排序 快排

#include <stdio.h>
#include <stdlib.h>


void mysort(int *a,  int low, int m)
{
	int shang = low;
	int xia = m;
	int temp = a[shang];
	while (shang < xia)
	{
		while (shang < xia&&a[xia] > temp)
			xia--;
		a[shang] = a[xia];
		while (shang < xia&&a[shang] <= temp)
			shang++;
		a[xia] = a[shang];
	}
	a[shang] = temp;
	if (shang - 1>low)
	{
		mysort(a, low, shang-1);
	}
	if (shang + 1 < m)
	{
		mysort(a, shang+ 1,m);
	}

}

void main()
{

	int a[10] = {8,12,23,45,144,78,45,67,8,0};
	
	mysort(a,0,10-1);
	for (int i = 0; i < 10; i++)
		printf("%d  ", a[i]);
	system("pause");
}