Sorting

Question 87

_____sorting algorithms has the lowest worst case complexity

A	Selection sort
B	Bubble sort
C	Merge sort
D	Quick sort

AlgorithmsSortingNielit Scentist-B [02-12-2018]Video-Explanation

Question 87 Explanation:

The Worst case time complexity of Selection,Bubble and Quick sort is O(n²) where as Merge sort is O(nlog(n)). So Merger sort has lowest worst case time complexity

Correct Answer: C

Question 87 Explanation:

The Worst case time complexity of Selection,Bubble and Quick sort is O(n²) where as Merge sort is O(nlog(n)). So Merger sort has lowest worst case time complexity

Swmdwn Basumatary

0 0 votes

Article Rating

0 Comments

Inline Feedbacks

View all comments