ЁЯУв Too many exams? DonтАЩt know which one suits you best? Book Your Free Expert ЁЯСЙ call Now!

    Question

    The time complexity of the best case for QuickSort

    is:
    A O(n┬▓) Correct Answer Incorrect Answer
    B O(n log n) Correct Answer Incorrect Answer
    C O(n) Correct Answer Incorrect Answer
    D O(log n) Correct Answer Incorrect Answer
    E O(n┬│) Correct Answer Incorrect Answer

    Solution

    When the pivot divides the array evenly, QuickSort achieves O(n log n) performance.

    Practice Next
    More Algorithms Questions
    ask-question