快速排序一趟之后,主元pivot到了他最终应该在的位置,如果是从小到大排序,那么一趟排序之后,他左边的数都是比它小的,他右边的数都是比它大的数,所以,如果我们要找出第K小的数,我们可以在一趟排序后,检查主元的位置和K是否对应
if(pos+1 == k),因为下标是从0开始的,所以要加1。如果相等的话,就正好是要找的第K小的数,否则,if(pos+1>k),说明要找的数在主元的左边,我们就只需要对左边继续进行快排,这样可以节约时间。if(pos+1<k),就说明要找的数是在主元的右半部分。
找第K大的数时,就是把数组从大到小来排,只需要在划分子集的函数中,将大于小于号调换一下。
#include<iostream>
using namespace std;
//从小到大排序
int partion1(int A[], int low, int high)
{
int pivot = A[low];//用第一个数作为主元
while (low < high)
{
while (low < high && A[high] >= pivot)
--high;
A[low] = A[high];
while (low < high&&A[low] <= pivot)
++low;
A[high] = A[low];
}
A[low] = pivot;
return low;
}
//修改大于小于号后,从大到小排序
int partion2(int A[], int low, int high)
{
int pivot = A[low];//用第一个数作为主元
while (low < high)
{
while (low < high && A[high] <= pivot)
--high;
A[low] = A[high];
while (low < high&&A[low] >= pivot)
++low;
A[high] = A[low];
}
A[low] = pivot;
return low;
}
//调用从小到大排序的分割法,来找出第K小的数
int find_k_small(int A[], int low, int high, int k)
{
if (low <= high)
{
int pivot_pos = partion1(A, low, high);
if (pivot_pos + 1 == k)
return A[pivot_pos];
else if (pivot_pos + 1 > k)
find_k_small(A, low, pivot_pos - 1, k);
else
find_k_small(A, pivot_pos + 1, high, k);
}
else
return -1;
}
//找出第K大的数
int find_k_big(int A[], int low, int high, int k)
{
if (low <= high)
{
int pivot_pos = partion2(A, low, high);
if (pivot_pos + 1 == k)
return A[pivot_pos];
else if (pivot_pos + 1 > k)
find_k_big(A, low, pivot_pos - 1, k);
else
find_k_big(A, pivot_pos + 1, high, k);
}
else
return -1;
}
void quick_sort1(int A[], int low, int high)
{
if (low < high)
{
int pivot_pos = partion1(A, low, high);
quick_sort1(A, low, pivot_pos - 1);
quick_sort1(A, pivot_pos + 1, high);
}
}
void quick_sort2(int A[], int low, int high)
{
if (low < high)
{
int pivot_pos = partion2(A, low, high);
quick_sort2(A, low, pivot_pos - 1);
quick_sort2(A, pivot_pos + 1, high);
}
}
int main()
{
int n;
cout << "输入元素个数: ";
cin >> n;
int *A = new int[n];
for (int i = 0; i < n; ++i)
cin >> A[i];
int k;
cout << "输入要找出第几小的数: " << endl;
cin >> k;
cout << "找出第" << k << "小的数:" << endl;
int ans = find_k_small(A, 0, n - 1, k);
cout << ans << endl;
cout << "排序后的结果:" << endl;
quick_sort1(A, 0, n - 1);
for (int i = 0; i < n; ++i)
cout << A[i] << " ";
cout << endl;
int k2;
cout << "输入要找出第几大的数: " << endl;
cin >> k2;
cout << "找出第" << k2 << "大的数:" << endl;
ans = find_k_big(A, 0, n - 1, k2);
cout << ans << endl;
cout << "排序后的结果:" << endl;
quick_sort2(A, 0, n - 1);
for (int i = 0; i < n; ++i)
cout << A[i] << " ";
cout << endl;
delete[] A;
return 0;
}