What is the best-case time complexity of QuickSort? - Study24x7
Social learning Network

Warning: include(./views/auth.php): failed to open stream: Permission denied in /var/www/html/live/loginRightSlider.php on line 18

Warning: include(): Failed opening './views/auth.php' for inclusion (include_path='.:/usr/share/php') in /var/www/html/live/loginRightSlider.php on line 18

Warning: count(): Parameter must be an array or an object that implements Countable in /var/www/html/live/makepost.php on line 52
2 followers study24x7 29 Jul 2024 12:19 PM study24x7 study24x7

What is the best-case time complexity of QuickSort?

A

O(n log n)

B

O(n)

C

O(log n)

D

O(n^2)

study24x7
Write a comment
Related Questions
500+   more Questions to answer
Most Related Articles