Sorting algorithms which has the lowest worst case complexity - Algorithms - Merge sort

Q.  From the following sorting algorithms which has the lowest worst case complexity?
- Published on 16 Jun 15

a. Bubble sort
b. Quick sort
c. Merge sort
d. Selection sort

ANSWER: Merge sort
 
Let the input be n. The merge sort uses the weak complexity their complexity is shown as O(n log n).

Related Content

➨ Post your comment / Share knowledge


Enter the code shown above:

(Note: If you cannot read the numbers in the above image, reload the page to generate a new one.)
▲