Question
What is the best case time complexity for insertion sort to sort an array of n elements?A. $\boldsymbol{\Omega}$ (n)B. $\Omega(n \log n)$C. $\Omega\left(n^2\right)$D. $\Omega\left(n \log n^2\right)$
Step 1
Insertion sort is an algorithm that builds the final sorted array one item at a time. It iterates through an array, consuming one input element at each repetition, and growing a sorted output list. Show more…
Show all steps
Your feedback will help us improve your experience
18,000,000+
Students on Numerade
Trusted by students at 8,000+ universities
Watch the video solution with this free unlock.
EMAIL
PASSWORD