- (10 pts) Suppose we are comparing implementations of two different sorting algorithms, insertion sort and merge sort. For inputs of size n, insertion sort runs in 8n2 steps, while merge sort requires 64n lg n steps. For which values of n does insertion sort beat merge sort.
Created
September 14, 2015 13:58
-
-
Save jondoesntgit/594059eee40e3a485110 to your computer and use it in GitHub Desktop.
Homework 01 Due 23:55 on 150914
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment