selectionSort.cpp

// Created on 06-07-2019 18:33:24 by necronomicon
#include <bits/stdc++.h>
using namespace std;

#define MP make_pair
#define PB push_back
#define ARR_MAX (int)1e5 //Max array length
#define INF (int)1e9 //10^9
#define EPS 1e-9 //10^-9
#define MOD 1000000007 //10^9+7
#define PI 3.1415926535897932384626433832795
typedef long int int32;
typedef unsigned long int uint32;
typedef long long int int64;
typedef unsigned long long int  uint64;
typedef pair<int, int> Pii;
typedef vector<int> Vi;
typedef vector<string> Vs;
typedef vector<Pii> VPii;
typedef vector<Vi> VVi;
typedef map<int,int> Mii;
typedef set<int> Si;
typedef multimap<int,int> MMii;
typedef multiset<int> MSi;
typedef unordered_map<int,int> UMii;
typedef unordered_set<int> USi;
typedef unordered_multimap<int,int> UMMii;
typedef unordered_multiset<int> UMSi;
typedef priority_queue<int> PQi;
typedef queue<int> Qi;
typedef deque<int> DQi;

/* 
    Take min from forward array and swap it with current element and advance a pos.
 */

void swap(int &a, int &b){
    int temp = a;
    a = b;
    b = temp;
}

void selection(Vi &v){
    int n = v.size();
    for (int i = 0; i < n; i++)
    {
        int mn = n-1;
        for (int j = i+1; j < n; j++)
        {
            if(v[mn]>v[j]){
                mn = j;
            }
        }
        if(v[mn] < v[i]){
            swap(v[mn], v[i]);
        }
    }
}

int main () {
	Vi v;
    v.push_back(2);
    v.push_back(3);
    v.push_back(5);
    v.push_back(1);
    v.push_back(-10);
    selection(v);
    std::for_each(std::begin(v), std::end(v), [](int a) {
      cout << a << ' ';
    });
    return EXIT_SUCCESS;
}