Multiple Choice
What is the best-case running time of merge sort when searching a single-dimensional array of size n?
A) O( n2 log n )
B) O( n )
C) O( n log n )
D) O( n2 )
Correct Answer:
Verified
Correct Answer:
Verified
Related Questions
Q31: Running times represented using the Big-Oh notation
Q32: Most programmers tend to disregard _ when
Q33: Which of the following is the Big-Oh
Q34: Which of the following will result in
Q35: The pattern T(n) = 2<sup>k</sup> T(n /
Q37: In terms of Big-Oh notation, a running
Q38: What is the Big-Oh of the function
Q39: When we measure the speed performance of
Q40: Analyze whether you should be more concerned
Q41: What is the typical running time of