Ignoring small terms (those significantly less than N) in the answer to the previous exercise, find a function f(M) so that the number of comparisons is approximately 2NlnN+f(M)N. Plot the function f(M), and find the value of M that minimizes the function.

## Comments

Sort by:

TopNewestanalysis of algorithm again :) – Pryhant Kielh · 3 years ago

Log in to reply