Multiple Choice
Merge sort is a(n) ____ algorithm.
A) O(n)
B) O(n log(n) )
C) O(n2)
D) O(log n)
Correct Answer:

Verified
Correct Answer:
Verified
Related Questions
Q55: Choose the order of the following growth
Q56: When your class implements a comparator object,
Q57: Which notation, big-Oh, theta, or omega describes
Q58: Binary search is an _ algorithm.<br>A) O(n)<br>B)
Q59: Can you search the following array using
Q61: The code segment below displays a table
Q62: In the worst case, quicksort is a(n)
Q63: Suppose an array has n elements. We
Q64: An algorithm that tests whether the first
Q65: Which selection sort iteration guarantees the array