retagged by
3,869 views

2 Answers

4 votes
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.
2 votes
2 votes
Option D ) Bubble sort is slowest because , Average case complexity of bubble sort is O(n^2)

                 , Avg. case complexity of quick sort and merge sort is O(nlogn)       

                 , Avg. case complexity of shell sort is O(n^3/2)
Answer:

Related questions

1 votes
1 votes
4 answers
1
admin asked Mar 31, 2020
4,351 views
Selection sort, quick sort is a stable sorting methodTrue,TrueFalse,FalseTrue,FalseFalse,True
0 votes
0 votes
1 answer
2
admin asked Mar 31, 2020
1,832 views
What is the type of the algorithm used in solving the $4$ Queens problem?GreedyBranch and BoundDynamicBacktracking
5 votes
5 votes
2 answers
3
admin asked Mar 31, 2020
1,795 views
Complexity of Kruskal's algorithm for finding minimum spanning tree of an undirected graph containing $n$ vertices and $m$ edges if the edges are sorted is:$O(mn)$$O(m)$$...
1 votes
1 votes
4 answers
4