Question

    Which sorting algorithm has an average-case time

    complexity of O(n log n) and is known for its efficiency, often using a divide-and-conquer approach?
    A Bubble Sort Correct Answer Incorrect Answer
    B Selection Sort Correct Answer Incorrect Answer
    C Insertion Sort Correct Answer Incorrect Answer
    D Quick Sort Correct Answer Incorrect Answer
    E Radix Sort Correct Answer Incorrect Answer

    Solution

    Quick Sort

    Practice Next
    More Algorithms Questions
    ask-question