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
Q2: Which of the following is a negative
Q3: Which of the following statements is true?<br>A)
Q4: is the efficiency of linear search?<br>A) O(1).<br>B)
Q5: What does each iteration of the insertion
Q6: Which of the following sorting algorithms is
Q8: What does the first pass of selection
Q9: Big O highlights _ factors and ignores
Q10: The linear search algorithm runs in _time.<br>A)
Q11: What is the base case for the
Q12: Big O notation is concerned with the