In a permutation a₁ ... a_n, of n distinct integers, an inversion is a pair (a_i, a_j) 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?

Keep practicing — related questions

• Insertion sort's worst-case time complexity is
• Insertion sort's worstcase time complexity is
• In a permutation a1 ... an, of n distinct integers, an inversion is a pair (ai, aj) such that i < j and ai ...
• In a permutation a1 ... an, of n distinct integers, an inversion is a pair (ai, aj) such that i < j and ai ...
• In a permutation a1 ... an, of n distinct integers, an inversion is a pair (ai, aj) such that i < j and ai ...
• Insertion sort's worst case space complexity is
• Insertion sort's average time complexity is
• Insertion sort's average time complexity is