Multiple Choice
The behavior of quick sort is ____ in the worst case and ____ in the average case.
A) O(nlog2n) , O(nlog2n)
B) O(n2) , O(n)
C) O(nlog2n) , O(n2)
D) O(n2) , O(nlog2n)
Correct Answer:

Verified
Correct Answer:
Verified
Related Questions
Q1: For a list of length n, the
Q2: When working with the unsorted portion of
Q12: When moving array values for insertion sort,
Q21: During the sorting phase of insertion sort,
Q30: The behavior of merge sort is _
Q31: The _ search algorithm is the optimal
Q35: The top node of a comparison tree
Q35: For a list of length n,insertion sort
Q38: Which of the following correctly states the
Q38: Suppose that L is a sorted list