SelectionSort

#include<bits/stdc++.h>

using namespace std;


void swap(int *a, int *b)  
{  
    int t = *a;  
    *a = *b;  
    *b = t;  
}

void sort(int* arr, int n)  
{  
    int i, j;
    int minIndex = -1;  
  
    for (i = 0; i < n-1; i++)  
    {  
        minIndex = i;  
        for (j = i+1; j < n; j++)  
        if (arr[j] < arr[minIndex])  
            minIndex = j;  
  
        swap(&arr[minIndex], &arr[i]);  
    }  
}  

void printArray(int arr[], int size)  
{  
    for (int i=0 ; i < size ; i++)  
        cout << arr[i] << " ";  
    cout << endl;  
} 

int main()
{
  	int arr[] = {80, 15, 19, 90, 11, 13, 32};  
    int n = sizeof(arr)/sizeof(arr[0]); 

    sort(arr, n);  
    printArray(arr, n); 
	
}