Question: What is the best case time complexity for insertion sort to sort an array of n elements? A. (n) B. (n log n)
What is the best case time complexity for insertion sort to sort an array of n elements?
A. Ω (n)
B. Ω (n log n)
C. Ω (n2)
D. Ω (n log n2)
Step by Step Solution
3.30 Rating (159 Votes )
There are 3 Steps involved in it
A Explanation In insertion sort the best case occ... View full answer
Get step-by-step solutions from verified subject matter experts
