the elements are
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
@arjun sir how did you take the last step to sort 50 element,
"Final 50 element take Θ(50n)=Θ(n) Θ(50n)=Θ(nΘ(50n)=Θ(n)
Whether first i elements or last k are unsorted, it is ultimately an unsorted array only. So it is not the best case. It may be average case or worst case, since we don't know thw inputs. Comparing all the sort given in the option it is either Merge sort or quick sort. Correct me, if I missed something.