Multiple Choice
What is the average-case running time of merge sort when sorting a single-dimensional array of size n?
A) O( n2 log n )
B) O( 2n )
C) O( n log n )
D) O( n2 )
Correct Answer:
Verified
Correct Answer:
Verified
Related Questions
Q1: What is the average running time of
Q2: It has become common in the industry
Q3: Evaluate whether the following code is efficient.
Q5: Compare the running times of these two
Q6: Which of the following has the lowest
Q7: A function has the running time T(
Q8: How does the while loop execution in
Q9: Merge Sort and Quick Sort are two
Q10: When programming, you want as tight an
Q11: To analyze the running time of a