How does it work?
Each element Array[j] is taken one at a time from j = 0 to n-1.
Before insertion of Array[j], the subarray from Array[0] to Array[j-1] is sorted, and the remainder of the array is not.
After insertion, Array[0…j] is correctly ordered, while the subarray with elements Array[j+1]…..Array[n-1] is unsorted.