QuickSelect.h
#ifndef QUICKSELECT_H
#define QUICKSELECT_H
#include<vector>
using namespace std;
class QuickSelect
{
private:
int len;
vector<int> list;
public:
QuickSelect(vector<int> _list, int _len);
void quick_select(int , int );
void swap(int , int );
void out();
};
#endif
QuickSelect.cpp
#include"QuickSelect.h"
#include<iostream>
using namespace std;
QuickSelect::QuickSelect(vector<int> _list, int _len)
{
for (int i=0; i<_len; i++)
list.push_back(_list[i]);
this->len = _len;
}
//quick sort
void QuickSelect::quick_select(int left, int right)
{
int i = left;
int j = right;
int pivot = list[left];
while (i<j)
{
while (i<j && list[j]>=pivot) //find element < pivot
j--;
if(i < j) swap(i, j);
while (i<j && list[i]<=pivot) //find >
i++;
if(i < j) swap(i, j);
}
if (i!=left) quick_select(left, i-1);
if (j!=right) quick_select(j+1, right);
}
void QuickSelect::swap(int i, int j)
{
int temp = list[i];
list[i] = list[j];
list[j] = temp;
}
void QuickSelect::out()
{
for(int i = 0; i<len; i++)
{
cout<< list[i] << " ";
if ((i+1)%18 == 0) cout << endl;
}
cout << endl;
}
main.cpp
#include"QuickSelect.h"
#include<vector>
#include<iostream>
int main()
{
vector<int> list;
int tmp;
cout << "please input num: ";
while(cin >> tmp && tmp != 0){
list.push_back(tmp);
}
QuickSelect qui(list, list.size());
if((list.size())%2==0) qui.quick_select((list.size())/2, (list.size())/2);
else qui.quick_select((list.size()+1)/2, (list.size()+1)/2-1);
qui.out();
return 0;
}