Question

    What is the best-case time complexity of any

    comparison-based sorting algorithm?
    A O(n) Correct Answer Incorrect Answer
    B O(log n) Correct Answer Incorrect Answer
    C O(n^2) Correct Answer Incorrect Answer
    D O(n log n) Correct Answer Incorrect Answer

    Solution

    The correct answer is D

    Practice Next

    Relevant for Exams: