Daily Updates
   HTML
   HTML5
   CSS
   CSS3
   JavaScript
   jQuery
   AngularJS
   Articles
   Blog
logo
Algorithm - Quiz(MCQ)
Which of the following is not true about comparison based sorting algorithms?
A)
Counting Sort is not a comparison based sorting algorithm
B)
The minimum possible time complexity of a comparison based sorting algorithm is O(nLogn) for a random input array
C)
Any comparison based sorting algorithm can be made stable by using position as a criteria when two elements are compared
D)
Heap Sort is not a comparison based sorting algorithm.

Correct Answer : Option (D) :   Heap Sort is not a comparison based sorting algorithm.

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