Big o - algorithm comparison


Question:

Big O - algorithm comparison

Suppose program A takes (2^n)/1000 units of time and program B takes 1000(n^2) units. For what values of n does program A take less time than program B.

Solution Preview :

Prepared by a verified Expert
Data Structure & Algorithms: Big o - algorithm comparison
Reference No:- TGS01937554

Now Priced at $20 (50% Discount)

Recommended (92%)

Rated (4.4/5)