MCQOPTIONS
Bookmark
Saved Bookmarks
→
Counting Sort Multiple Choice
→
General
→
How many comparisons will be made to sort the arra...
1.
How many comparisons will be made to sort the array arr={1,5,3,8,2} using counting sort?
A.
5
B.
7
C.
9
D.
0
Answer» E.
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
Which of the following algorithm takes non linear time for sorting?
What is the disadvantage of counting sort?
What is the advantage of counting sort over quick sort?
Counting sort is often used as a sub routine for radix sort.
Which of the following statement is true about comparison based sorting?
The complexity of which of the following sorting algorithms remains to be the same in its best, average and worst case?
What is the average time complexity of counting sort?
Which of the following uses the largest amount of auxiliary space for sorting?
Which of the following sorting techniques is stable?
It is not possible to implement counting sort when any of the input element has negative value.
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply
Your experience on this site will be improved by allowing cookies. Read
Cookie Policy
Reject
Allow cookies