向量的选择排序类 (C++ 实现)
#include <iostream> #include <vector> #include <string> #include <sstream> using namespace std; class selectionSort { public: selectionSort(vector<int> &); void swap(int *, int *); }; int main() { vector<int> v; int n; string s; getline(cin, s); stringstream ss(s); while (ss >> n) { v.push_back(n); } selectionSort sel(v); for (unsigned int i = 0;i < v.size();i++) { cout << v[i] << " "; } cout << endl; return 0; } selectionSort::selectionSort(vector<int> &v) { int s = v.size(); for (int i = 0;i < s - 1;i++) { int min = i; for (int j = i + 1;j < s;j++) { if (v[min] > v[j]) { min = j; } } swap(&v[i], &v[min]); } } void selectionSort::swap(int *p1, int *p2) { int temp = *p1; *p1 = *p2; *p2 = temp; }