第k小的元素

 

#include <stdio.h>

#define LEN 8
int a[LEN] = { 2, 8, 7, 1, 3, 5, 6, 4 };

void swap(int *a, int *b)
{
	int temp = *a;
	*a = *b;
	*b = temp;
}

int order_statistic(int start, int end, int k)
{
	int i = start - 1, pivot = a[end], j;
	for (j = start; j < end; j++)
		if (a[j] <= pivot)
			swap(&a[++i], &a[j]);
	swap(&a[++i], &a[j]);
	if (i == k - 1)
		return a[i];
	else if (i > k - 1)
		return order_statistic(start, i-1, k);
	else
		return order_statistic(i+1, end, k);
}

int main(void)
{
	printf("%d\n", order_statistic(0, LEN-1, 1));
	return 0;
}