Waste less time on Facebook — follow Brilliant.

algorithm 3

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 2Nln⁡N+f(M)N. Plot the function f(M), and find the value of M that minimizes the function.

Note by Pryhant Kielh
4 years ago

No vote yet
1 vote


Sort by:

Top Newest

analysis of algorithm again :)

Pryhant Kielh - 4 years ago

Log in to reply


Problem Loading...

Note Loading...

Set Loading...