New Click here to Attempt NABARD Scholarship Test

    Question

    Which sorting algorithm has a worst-case time complexity

    of O(n^2)?
    A QuickSort Correct Answer Incorrect Answer
    B MergeSort Correct Answer Incorrect Answer
    C Bubble Sort Correct Answer Incorrect Answer
    D Insertion Sort Correct Answer Incorrect Answer

    Solution

    The correct answer is C

    Practice Next

    Relevant for Exams: