What is the speedup of the modification, if any? Is it reasonable to assume that the instruction counts don't change? That is, under what conditions is it possible to get the type of modification presented in this problem.
What is the effective speedup? What percentage of the new execution time is spent using the new square-root process?
If I wanted to achieve an effective speedup of 4, how much faster would the new square-root process need to be.