Your manager shows you two algorithms: one is O(N), the other is 0(1). He is confused because the 0( N) algorithm performs better than the 0( 1) algorithm for his data set where N = 16K. Upon...

Your manager shows you two algorithms: one is O(N), the other is 0(1). He is confused because the 0( N) algorithm performs better than the 0( 1) algorithm for his data set where
N
= 16K. Upon inspection, you determine that the O(N) algorithm makes exactly
N
passes through the data and that each pass implies hidden constant costs of 17 instructions per pass. If the 0( 1) algorithm makes exactly one pass through the data, estimate the hidden constant costs (i.e .,

instructions per pass) that you would expect to find in order to explain its

slower performance.