Can this be called an insertionSort?
Yes, it is a variant that does the inner loop from the opposite side than the canonical version. 

This has the effect that you do a lot more comparisons than you would otherwise because you cannot early out as soon as you find where the element should be inserted to.

Now for the nitpicks:

There is no need to #include&lt;iostream&gt; for this.

Indentation isn't consistent.