Bubble Sort takes Ω(n) in the best case. The option provided is not correct.

Ref: https://www.geeksforgeeks.org/time-complexities-of-all-sorting-algorithms/

Dark Mode

1,919 views

4 votes

Option D Bubble Sort

Time complexity of merge sort is $O(nlogn)$ in all cases best ,average, worst

time complexity of quick sort in best case $O(nlogn)$ and in worst case $O(n^{2})$

time complexity of sell sort in best case $O(nlogn)$ and in worst case $O(n^{2})$

Time complexity of Bubble sort take $O(n^{2})$ in all case best ,average ,and worst so bubble sort is slowest in among all.

Time complexity of merge sort is $O(nlogn)$ in all cases best ,average, worst

time complexity of quick sort in best case $O(nlogn)$ and in worst case $O(n^{2})$

time complexity of sell sort in best case $O(nlogn)$ and in worst case $O(n^{2})$

Time complexity of Bubble sort take $O(n^{2})$ in all case best ,average ,and worst so bubble sort is slowest in among all.

Bubble Sort takes Ω(n) in the best case. The option provided is not correct.

Ref: https://www.geeksforgeeks.org/time-complexities-of-all-sorting-algorithms/

0