MCQOPTIONS
Bookmark
Saved Bookmarks
→
Pigeonhole Sort Multiple Choice
→
General
→
Pigeonhole sort is an in place sorting algorithm.
1.
Pigeonhole sort is an in place sorting algorithm.
A.
true
B.
false
Answer» C.
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
Which of the following algorithm takes linear time for sorting?
What is the advantage of pigeonhole sort over merge sort?
What is the average time complexity of pigeonhole sort (k=range of input)?
Pigeonhole sort is an in place sorting algorithm.
Pigeonhole sort is a stable sorting algorithm.
The auxiliary array used in pigeonhole sorting is called ______________
What is the space complexity of pigeonhole sort (k=range of input)?
In which of the following case pigeonhole sort is most efficient?
Which of the following is a non-comparison sort?
How many comparisons will be made to sort the array arr={1,5,3,8,2} using pigeonhole sort?
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
