Programming Assignment
Implement a program that finds the zero of a function
Use the function for your testing to be that defined in problem 1.2-2,
f(n) = 8n2 - 64n lg n
Suppose we are comparing implementations of insertion sort and merge sort on the same machine. For inputs of size n, insertion sort runs in 8n2 steps, while merge sort runs in 64n lg n steps. For which values of n does insertion sort beat merge sort?