Given an array list A of n elements. If A is divided into n/(a*b) groups, where a,b > 0, a, b ∈ N, n is divisible by a*b. Moreover, a*b can not be ignored compare with n. The time complexity of sorting A by insertion sort is______________________________.

Answer rating: 100% (QA)

We know that Insertion sort time complexity is O... View the full answer