Algorithm B requires exactly C (n) = (log₂ n)² basic operations, where is the input size. Suppose that on your current l
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
Algorithm B requires exactly C (n) = (log₂ n)² basic operations, where is the input size. Suppose that on your current l
Algorithm B requires exactly C (n) = (log₂ n)² basic operations, where is the input size. Suppose that on your current laptop, the algorithm takes t seconds to run on an input size ng ('S' stands for "slow"). Then the same algorithm will take t seconds for an input size ne on a laptop that is 256x faster than your current one ('F' stands for "fast"). Choose the correct statement below. nF = n² nF = n² 16 nF = ns O nF = ns 256 nF = 2ns nF = 4ns O nF = 16ns nF 256ns O None of the above is correct.
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!