COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
Quick sort
|
|
|
Merge sort
|
|
|
Selection sort
|
|
|
Bubble sort
|
Detailed explanation-1: -The merge sort uses the weak complexity their complexity is shown as O(n log n).
Detailed explanation-2: -The worst case best run time complexity is O(nlogn) which is given by-Merge Sort and Heap Sort.
Detailed explanation-3: -Explanation: The time complexity of merge sort is not affected by worst case as its algorithm has to implement the same number of steps in any case. So its time complexity remains to be O(n log n).
Detailed explanation-4: -The time complexity of Quicksort is O(n log n) in the best case, O(n log n) in the average case, and O(n^2) in the worst case. But because it has the best performance in the average case for most inputs, Quicksort is generally considered the “fastest” sorting algorithm.