Multiple Choice
What is the efficiency of merge sort?
A) O(log n) .
B) O(n) .
C) O(n log n) .
D) O(n2) .
Correct Answer:
Verified
Correct Answer:
Verified
Related Questions
Q1: Which of the following is a way
Q2: Which of the following is a negative
Q14: How many comparisons will the linear search
Q15: The linear search algorithm runs in _time.<br>A)quadratic<br>B)O(n)<br>C)constant<br>D)nonlinear
Q16: Big O highlights _ factors and ignores
Q17: How much faster is insertion sort with
Q17: Using a binary search, what is the
Q18: What is the base case for the
Q19: Different sorting algorithms on a particular array
Q22: What does each iteration of the insertion