Register

Sorting:

3,782 views
0 0 votes

You have to sort 1 GB of data with only 100 MB of available main memory. Which sorting technique will be most appropriate?

1)QuickSort

2)MergeSort

3)HeapSort

4)Selection Sort

Explain? How

1 Answer

Voting & Accepting an answer helps improve the community
← Previous · ArrayNext → · Arrays
← Previous in category · Heap Sort :Next in category → · Merge Sort
Position:
Show:

Related questions

0 0 votes
0 0 answers
967
967 views
Rahul Ranjan 1 asked Jun 15, 2018
967 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.4k
2.4k views
pankaj_vir asked Mar 19, 2018
2,351 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
1 1 answer
1.1k
1.1k views
admin asked Jul 28, 2023
1,054 views
UGC NET CSE | June 2023 | Part 2: 21
Consider the following statements about heap sort algorithm:The MAX-HEAPIFY procedure which runs in $\mathrm{O} \lg (n)$ time, is the key to maintaining the max heap prop...
1 1 vote
1 1 answer
1.2k
1.2k views
reena_kandari asked Jul 30, 2016
1,243 views
heap sort
The number of elements that can be sorted in time using heap sort ?