Ask Question
10 February, 14:21

Suppose we are comparing the implementations of insertion sort and merge sort on the same machine (You don't need to know the algorithm to do this problem!). For inputs of size n, insertion sort runs in 8n^2, while merge sort runs in 64nlgn steps. For which values of n does insertion sort beat merge sort?

+5
Answers (1)
  1. 10 February, 17:40
    0
    123456789o0
Know the Answer?
Not Sure About the Answer?
Get an answer to your question ✅ “Suppose we are comparing the implementations of insertion sort and merge sort on the same machine (You don't need to know the algorithm to ...” 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