Multiple Choice
A merge sort operation runs in:
A) O(log n) time.
B) O(n) time.
C) O(n log n) time.
D) O(n2) time.
Correct Answer:
Verified
Correct Answer:
Verified
Related Questions
Q1: The first step performed by the binary
Q2: Selection sort has a Big O of:<br>A)
Q3: An algorithm that requires _ operations to
Q4: The choice of which sorting algorithm to
Q5: The merge sort algorithm:<br>A) Can be used
Q7: At most, how many comparisons are required
Q8: Which of the following represents the efficiency
Q9: Which of the following statements about searching
Q10: Which of the following is not a