Insertion Sort

the elements are

10 elements unsorted | n-60 elements sorted | 50 elements unsorted |

so we can perform shift of these 10 elements to the end which will take Θ(n) time and now we can perform insertion sort on complete array and here array is almost sorted so it will take overall Θ(n) time.

@ Arjun sir ...pls check this concept