Which sorting algorithm has a worst-case time complexity of O(n2)?

PYQ IBPS SO CRP SPL-XIII (2023)

Which sorting algorithm has a worst-case time complexity of O(n2)?

  1. A.

    Merge Sort

  2. B.

    Radix Sort

  3. C.

    Bubble Sort

  4. D.

    Heap Sort

  5. E.

    None of the above

Attempted by 61 students.

Sign up free to check your answer

Sign up free

Explore the full course: Ibps So It Mains

Loading lesson…