Can this be called an insertionSort? Can following code be called insertion sort?
I tried implementation according to my underdtanding...

#include&lt;iostream&gt;
void insertionSort(int* array,int length){
       for(int unsortedIndex=1; unsortedIndex&lt;length;unsortedIndex++){
           for(int sortedIndex=0; sortedIndex&lt;unsortedIndex; sortedIndex++){
            if(array[unsortedIndex] &lt; array[sortedIndex]){
                int temp = array[sortedIndex];
                array[sortedIndex] = array[unsortedIndex];
                array[unsortedIndex] = temp;
            }
        }
    }
}
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.