#include <iostream>
#include <algorithm>

using namespace std;

void selection_sort(int a[], int n){
    int i, j;
    for (i=0; i<n-1; i++){
        int small_index = i;
        for (j=i+1; j<n; j++){
            if (a[j]<a[small_index]){
                small_index =j;
            }
        }
        if (i!=small_index){
            swap(a[i],a[small_index]);
        }
    }
}

void bubble_sort(int a[], int n){
    bool swapped = true;
    while (swapped){
        swapped = false;
        for (int i=0; i<n-1; i++){
            if (a[i]>a[i+1]){
                swap(a[i],a[i+1]);
                swapped = true;
            }
        }
    }
}

void insertion_sort(int a[], int n){
    int i,j;
    for (i=1; i<n; i++){
       int tmp = a[i];
       int j = i-1;
       while (j>=0 && a[j]>tmp){
            a[j+1] = a[j];
            j--;
        }
        a[j+1] = tmp;
    }
}

int main()
{
    int a[] ={10,7,5,33,0,10,-10};
    int n = sizeof(a)/sizeof(int);
    insertion_sort(a,n);
    for (int i=0; i<n; i++){
        cout << a[i] << ' ';
    }
    return 0;
}