快速排序

二分排序

#include <stdio.h>

void sort(int * a,int n)
{
	if (n <= 1)
	{
		return;
	}
	int i = 0;
	int j = n-1;
	int k = a[j];
	int b = 0;
	for (; b<= j;)
	{
		if (a[b] > k)
		{
			int tmp = a[j];
			a[j] = a[b];
			a[b] = tmp;
			j--;
		}
		else if (a[b] == k)
		{
			b++;
		}
		else
		{
			int tmp = a[i];
			a[i] = a[b];
			a[b] = tmp;
			i++;
			b++;
		}
	}
	sort(a + j  , n - j);
	sort(a, j );

}

int main()
{
	int b[15] = { 25,52,3,100,5,64,7,48,9,10,11,12,13,15,14};
	sort(b,15);
	for (int k = 0; k < 15; k++)
	{
		printf("%d\n", b[k]);
	}
	return 0;
}