Q:

Randomized quicksort is an extension of quicksort where the pivot is chosen randomly. What is the worst case complexity of sorting n numbers using randomized quicksort?

YasminRadwan26

Save to bookmark

|

2022-05-30

|

210

0

Randomized quicksort is an extension of quicksort where the pivot is chosen randomly. What is the worst case complexity of sorting n numbers using randomized quicksort?

O(n^2)
O (n log n)
O(!n)
O (n)

Algorithms, MCQ Questions, Algorithms MCQ-questions,

login and add your own answer to this question

All Answers

YasminRadwan26

2022-05-30

need an explanation for this answer? contact us directly to get an explanation for this answer

Correct Answer:

O(n^2)

need an explanation for this answer? contact us directly to get an explanation for this answer

total answers (1)