insertion sort algorithm

insertion_sort.cpp

#include <vector>
#include <iostream>
using namespace std;

// insertion-sort integers given from stdin
int main()
{
    // create vector of integers
    vector<signed int> v;
    signed int input, tmp, idx;

    // create vector from stdin
    while (input != -999) {
        cin >> input;
        // stop -999 being added to the vector
        if (input != -999) {
            v.push_back(input);
        }
    }

    // insertion-sort the vector v
    for (int i=0; i<v.size(); i++) {
        tmp = v[i];
        idx = i;
        while (i>0 && v[i-1] > tmp) {
            v[i] = v[i-1];
            i--;
        }
        if (i != idx) {
            v[i] = tmp;
        }
    }

    // print ordered vecctor to stdout
    for (int j=0; j<v.size(); j++) {
        cout << v[j] << " ";
    }
    cout << endl;
    return 0;
}