📢 Too many exams? Don’t know which one suits you best? Book Your Free Expert 👉 call Now!


    Question

    Which sorting algorithm has O(n log n) average

    case?
    A Bubble sort Correct Answer Incorrect Answer
    B Insertion sort Correct Answer Incorrect Answer
    C Selection sort Correct Answer Incorrect Answer
    D Merge sort Correct Answer Incorrect Answer
    E Linear search Correct Answer Incorrect Answer

    Solution

    Merge sort uses divide & conquer with O(n log n).

    Practice Next
    ask-question