Sorting
October 28, 2023Sorting
October 28, 2023Sorting
|
Question 87
|
_____sorting algorithms has the lowest worst case complexity
|
Selection sort
|
|
|
Bubble sort
|
|
|
Merge sort
|
|
|
Quick sort
|
Question 87 Explanation:
The Worst case time complexity of Selection,Bubble and Quick sort is O(n2) 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(n2) where as Merge sort is O(nlog(n)). So Merger sort has lowest worst case time complexity