in Algorithms recategorized by
16,945 views
1 vote
1 vote

______ sorting algorithms has the lowest worst-case complexity.

  1. Selection Sort
  2. Bubble Sort
  3. Merge Sort
  4. Quick Sort
in Algorithms recategorized by
by
16.9k views

1 Answer

1 vote
1 vote

Answer is C.

Worst case complexity of merge sort is O(nlogn).

Answer:

Related questions