C++选择排序法(Selection Sort)

来源:互联网 发布:sql查询在哪 编辑:程序博客网 时间:2024/06/03 19:24
// implementation of Selection Sort (C++)#include <iostream>using namespace std;void SwapTwo(int& a, int& b){    int temp=a;    a=b;    b=temp;}void SelectionSort(int arr[], int size){    for (int i=0; i<size;i++)    {        int SmallestNum = arr[i];        int SmallestIndex = i;                for (int j=i; j<size; j++)        {            if (arr[j]<SmallestNum)            {                SmallestNum = arr[j];                SmallestIndex = j;            }        }        SwapTwo(arr[i], arr[SmallestIndex]);    }}int main(){    int nums[] = {3,45,7,78,45,23,56,56,1,2,43,28};        int size = sizeof(nums)/sizeof(int);        SelectionSort (nums, size);        for (int i=0;i<size;i++)    {        cout << nums[i] << " ";    }    cout << endl;    return 0;}


                                             
0 0
原创粉丝点击