Which of the following algorithms has a worst case complexity of O(n log 2 n)?
a) insertion sort
b) selection sort
c) bubble sort
d) merge sort
e) none of the above
d) merge sort
Computer Science & Information Technology
You might also like to view...
A(n) ________ forces users to conform to a specific data entry format for a given field
A) default value B) validation rule C) validation text D) input mask
Computer Science & Information Technology
Time Estimation Techniques
What will be an ideal response?
Computer Science & Information Technology