Question

    What is the best case time complexity of merge sort?

    A O(n*Log n) Correct Answer Incorrect Answer
    B O(Log n) Correct Answer Incorrect Answer
    C O(n) Correct Answer Incorrect Answer
    D None of these Correct Answer Incorrect Answer
    E All of these Correct Answer Incorrect Answer

    Solution

    The correct answer is A

    Practice Next