Daily Updates
   HTML
   HTML5
   CSS
   CSS3
   JavaScript
   jQuery
   AngularJS
   Articles
   Blog
logo
Algorithm - Quiz(MCQ)
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?
A)
O (n)
B)
O(!n)
C)
O(n^2)
D)
O (n log n)

Correct Answer : Option (C) :   O(n^2)

Recently Updated in Algorithm Questions
Q .
External entities in DFD are shown by_________
A)
Circle
B)
Ellipse
C)
Hexagon
D)
Rectangle

Correct Answer : Option (D) :   Rectangle

Q .
Assume that we use Bubble Sort to sort n distinct elements in ascending order. When does the best case of Bubble Sort occur?
A)
When elements are sorted in ascending order
B)
When elements are not sorted by any order
C)
When elements are sorted in descending order
D)
There is no best case for Bubble Sort. It always takes O(n*n) time

Correct Answer : Option (A) :   When elements are sorted in ascending order