Register

WHICH SORTING TO SELECT?

• retagged by
17,514 views
2 2 votes
As part of maintenance work, you are entrusted with the work of rearranging the library books in a shelf in proper order, at the end of each day. The ideal choice will be—
(a) Bubble sort     (b) Insertion sort (c) Selection sort     (d) Heap sort

1 Answer

1 1 vote
I think insertion Sort (B) will be right answer.

looking at the question in its sense that you have to arrange books in a shelf you just need to pick the book and find its place using insertion sort. Keep repeating till end
Voting & Accepting an answer helps improve the community
← Previous · MadeEasy Subject Tes...Next → · External fragmentati...
← Previous in category · made easy algo compl...Next in category → · cormen question rega...
Position:
Show:

Related questions

0 0 votes
1 1 answer
3.8k
3.8k views
pradeepchaudhary asked Jul 8, 2018
3,760 views
Sorting:
You have to sort 1 GB of data with only 100 MB of available main memory. Which sorting technique will be most appropriate?1)QuickSort2)MergeSort3)HeapSort4)Selection Sort...
0 0 votes
0 0 answers
955
955 views
Rahul Ranjan 1 asked Jun 15, 2018
955 views
Sorting
You are asked to sort 15 randomly generated numbers. One should prefer - 1. Bubble Sort2. Quick Sort3. Merge Sort4. Heap Sort Please explain why others 3 sorting algorith...
2 2 votes
1 answers 1 answer
2.3k
2.3k views
pankaj_vir asked Mar 19, 2018
2,322 views
Sorting
Consider the following two statements:P: There exists a comparison sort of 5 numbers that uses at most 6 comparisons in worst case.Q: Heap sort can be used as the auxilia...
0 0 votes
2 2 answers
871
871 views
reena_kandari asked Jan 10, 2017
871 views
Sorting
Consider the following two statementsP: There exists a comparison sort of 5 numbers that uses at most 6 comparisons in worst case.Q: Heap sort can be used as the auxiliar...