Worst-case complexities are:
Binary Search $=O(\log n)$
Linear Search $=O(n)$
Merge Sort $=O(n\log n)$
Bubble Sort $=O(n^2)$
Ascending order:
$O(\log n) < O(n) < O(n\log n) < O(n^2)$
So,
D, B, A, C
Correct option is:
$\boxed{(a)\ D,B,A,C}$
Online Test Series, Information About Examination, Syllabus, Notificationand More.
Are you sure to delete this comment ?