selection sort
#include <bits/stdc++.h> using namespace std; void selectionSort(int arr[], int n){ int i,j,min; for(i=0;i<n-1;i++){ min = i; for(j=i+1;j<n;j++){ if(arr[j] < arr[min]){ min = j; } } if(min != i){ swap(arr[i],arr[min]); } } } int main() { int arr[] = { 1,4,2,5,333,3,5,7777,4,4,3,22,1,4,3,666,4,6,8,999,4,3,5,32 }; int n = sizeof(arr) / sizeof(arr[0]); selectionSort(arr, n); for(int i = 0; i < n; i++){ cout << arr[i] << " "; } return 0; }