可以通过改写快速排序算法来得到快速选择算法,分别利用2种快速排序程序写的快速选择程序:
#include "stdafx.h"
#define CutOff (3)
void Swap(int *x,int *y)
{
int tmp;
tmp = *x;
*x = *y;
*y = tmp;
}
void InsertionSort(int A[], int N)
{
int i = 0;
int j = 0;
int tmp;
for (i=1; i<N; i++)
{
tmp = A[i];
for (j=i; j>0 && A[j-1]>tmp; j--)
{
A[j] = A[j-1];
}
A[j] = tmp;
}
}
int Median3(int A[], int Left, int Right)
{
int Center = (Left + Right) / 2;
if (A[Left] > A[Center])
Swap(&A[Left],&A[Center]);
if (A[Left] > A[Right])
Swap(&A[Left],&A[Right]);
if (A[Center] > A[Right])
Swap(&A[Center],&A[Right]);
Swap(&A[Center],&A[Right-1]);
return A[Right-1];
}
void Qselect(int A[], int k, int Left, int Right)
{
int i = 0;
int j = 0;
int Pivot = 0;
if (Left + CutOff <= Right)
{
Pivot = Median3(A,Left,Right);
i = Left;
j = Right - 1;
for ( ; ; )
{
while (A[++i] < Pivot){}
while (A[--j] > Pivot){}
if (i < j)
Swap(&A[i],&A[j]);
else
break;
}
Swap(&A[i],&A[Right-1]);
if (k <= i) //k从1开始,所以k=i+1时可以不用再排序了
Qselect(A,k,Left,i-1);
else if (k > i+1)
Qselect(A,k,i+1,Right);
}
else
InsertionSort(A+Left,Right-Left+1);
}
void Qselect2 (int A[], int k, int Left, int Right)
{
int pivot = A[(Left+Right)/2];
int i = Left;
int j = Right;
do
{
while (A[i] < pivot)
++i;
while (A[j] > pivot)
--j;
if (i <= j)
Swap(&A[i++],&A[j--]);
} while (i <= j);
if (j > Left && k-1 <= j)
Qselect2(A,k,Left,j);
if (i < Right && k-1 >= i)
Qselect2(A,k,i,Right);
}
int _tmain(int argc, _TCHAR* argv[])
{
int A[10] = {3,5,9,7,1,4,2,0,8,6};
Qselect(A,4,0,9);
int B[10] = {3,5,9,7,1,4,2,0,8,6};
Qselect2(B,4,0,9);
return 0;
}