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...

Word tables can sort data

Indicate whether the statement is true or false

Computer Science & Information Technology

Declaring an array, like declaring a variable, does not necessarily give it a value.

Answer the following statement true (T) or false (F)

Computer Science & Information Technology