选择排序算法

/*选择排序算法*/

#include <iostream>
using namespace std;
void swap(int *a,int *b)
{
    *a = *a ^ *b;
    *b = *a ^ *b;
    *a = *a ^ *b;
}

void selectionSort(int *array,int length)
{   
    if(array==nullptr||length==0)
        return;
    for (int i = 0; i < length; i++)
    {
        int index = i;
        int currentvalue=array[i];
        for (int j = i+1; j < length;j++)
        {
            if(array[j]<currentvalue)
            {
                index = j;
                currentvalue = array[j];
            }
        }
        swap(array[i],array[index]);
    }
}

int main()
{
    int arr[] = {3, 2, 4, 2, 8, 12, 9, 32};
    int n = sizeof(arr) / sizeof(arr[0]);
    selectionSort(arr, n);
    int i = 0;
    while(i<n)
    {
        cout << arr[i] << "\t";
        i++;
    }
}