🎴 Flashcard Mode
Test 4 - Algorithms | Computer Science(CS)
Card1 / 20
Mastered0
Review0
QuestionClick to flip
Randomized quick sort is an extension of quick sort where the pivot is chosen randomly. What is the worst case complexity of sorting n numbers using randomized quick sort?
AnswerClick to flip back
A
0(nlog n)
💡 Explanation:
In randomized quick sort pivot is chosen randomly, the case complexity of sorting n. In that case the worst case 0(n2) of quick sort become 0(nlog n) of randomize quick sort.