Insertion Sort Algorithm Code

//www.gammal.tech
#include <iostream>
#include <vector>
using namespace std;
void insertionSort(vector<int> &x){
-for(int i=1; i<x.size(); i++){
--int key = x[i], j=i-1;
--for( ; j>=0 ; j--)
---if( x[j]> key)
----x[j+1] = x[j];
---else
----break;
--x[j+1] = key;
-}
}
int main() {
-vector<int> x={3,2,6,7,9,4,5,8,1};
-insertionSort(x);
-for(int i=0; i<x.size(); i++)
--cout<<x[i]<<endl;
}