Algorithms | Sorting | Question 12

Last Updated :
Discuss
Comments

What is the worst case time complexity of insertion sort where position of the data to be inserted is calculated using binary search?

N

N*log(N)

N2

N*log(N)2

This question is part of this quiz :

Top MCQs on Complexity Analysis of Algorithms with Answers,Top MCQs on InsertionSort Algorithm with Answers,Top MCQs on Binary Search Algorithm with Answers
Tags:
DSA Quiz
Share your thoughts in the comments
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy