I dont understand this question please explain the question also the answer
Partition is median?
Also please explain ques 4 not able to put another doubt
Please explain , also no answers are available to quiz questions
In a permutation a1……an of n distinct integers, an inversion is a pair (ai, aj) such that i < j and ai > aj. What would be the worst case time complexity of the Insertion Sort algorithm, if the inputs are restricted to permutations of 1……n with at most n inversions?
O(n^2)
O(nlogn)
O(n^1.5)
O(n)