Why substituting the search part in INSERTION SORT doesnt yield a running time of $\Theta(nlgn)$
-
29-09-2020 - |
Solution
You still need to shift $O(n)$ elements to make room for the newly inserted element even if you find the correct position in $O(\log n)$.
Licensed under: CC-BY-SA with attribution
Not affiliated with cs.stackexchange