Q:

Which of the following sorting algorithms has the lowest worst-case complexity?

0

Which of the following sorting algorithms has the lowest worst-case complexity?


  1. Merge Sort
  2. Bubble Sort
  3. Quick Sort
  4. Selection Sort

All Answers

need an explanation for this answer? contact us directly to get an explanation for this answer

Correct Answer:

Merge Sort

need an explanation for this answer? contact us directly to get an explanation for this answer

total answers (1)

This question belongs to these collections

Similar questions


need a help?


find thousands of online teachers now