Ask Question
31 May, 03:39

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

a. Heap sort

b. Merge sort

c. Quick sort

d. Insertion sort

+1
Answers (1)
  1. 31 May, 06:22
    0
    I'm guessing that what's being looked at here moreso is the space complexity of these algorithms. Heap sort and insertion sort I believe have the lowest of these, but insertion sort is also known to not be the best with time complexity. Therefore heap sort should take the cake
Know the Answer?
Not Sure About the Answer?
Get an answer to your question ✅ “You have to sort 1 GB of data with only 100 MB of available main memory. Which sorting technique will be most appropriate? a. Heap sort b. ...” in 📙 Computers & Technology if there is no answer or all answers are wrong, use a search bar and try to find the answer among similar questions.
Search for Other Answers