in Algorithms recategorized by
1,019 views
1 vote
1 vote

Two alternative package $A$ and $B$ are available for processing a database having $10^{k}$ records. Package $A$ requires $0.0001 n^{2}$ time units and package $B$ requires $10n\log _{10}n$ time units to process $n$ records. What is the smallest value of $k$ for which package $B$ will be preferred over $A$?

  1. $12$
  2. $10$
  3. $6$
  4. $5$
in Algorithms recategorized by
by
1.0k views

3 Answers

1 vote
1 vote
This can be solved using substitution.

Substituting the value of 6 in k we get that A takes more time (10^8) than B (6 * 10^7). making B more preferable than A.
0 votes
0 votes
I think answer should be D
0 votes
0 votes
Answer:

Related questions