选择排序法 (Selection Sort)

// Selection Sort#include <iostream>using namespace std;void SwapTwo(int &a, int &b){int temp = a;a=b;b=temp;}int FindSIndex(int nums[], int start, int size){int smallest = nums[start];int smallest_Index = start;for (int i=start;i<size;i++){if (nums[i] < smallest){smallest = nums[i];smallest_Index = i;}}return smallest_Index;}void SortNums(int nums[], int size){for (int i=0;i<size; i++){int sIndex = FindSIndex(nums, i, size);SwapTwo(nums[sIndex], nums[i]);}}void Display(int nums[], int size){for (int i=0;i<size; i++){cout << nums[i] << endl;}}int main(){int nums[10] = {10,5,3,56,12,89,45,2,4,455};int size = sizeof(nums)/sizeof(int);SortNums(nums, size);Display(nums, size);return 0;}