29 views
Show that quicksort’s best-case running time is $\Omega(n\ lg\ n)$.
| 29 views

the best case in quicksort is when elements is in unsorted order then the function has to run only f(n)=2T(n/2)+n

when the elements are is increasing or decreasing oder than f(n) value become f(n)=T(n-1)+n because then the pivot element either present in first position or last position so the number of comparisons becomes (n-1) for sorting.
by (11 points)