SelectionSort

selectionSort.cpp

/* ************* SELECTION SORT speed  O(n^2) *************** */
#include <iostream>

int ar[] = { 5, 9, 21, 1, 34, 22, 8, 12, 0, 22, 90, 65 };
int size = sizeof(ar) / sizeof(ar[0]);
int min = 0;

void selectionSort(int arr[])
{
    for (int i = 0; i < size - 1; i++)
    {
        min = i;
        
        for (int j = i + 1; j < size; j++)
            if (arr[j] < arr[min])
                min = j;
        
        if (min != i)
        {
            int temp = arr[min];
            arr[min] = arr[i];
            arr[i] = temp;
        }
            
    }
}

int main()
{
    
    selectionSort(ar);
    
    for (int i = 0; i < size; i++)
        std::cout << ar[i] << " ";
    
    return 0;
}