Home/ Questions/Q 9172093
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-06-17T16:15:48+00:00

So this is a question in my homework…. Given that the efficiency of an

  • 0

So this is a question in my homework….

Given that the efficiency of an algorithm is n3, if a step in the algorithm takes 1 ns (10-9) seconds), how long does it take the algorithm to process an input of size 1,000?

Here is MY question: How do I figure this out? PLEASE DO NOT POST THE ANSWER. Help me learn how to figure this out for myself.

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    You define n to be 1000. Thus, you need n3 steps, each one of them taking 1 ns. Multiply the two and you have the answer.

    General idea: if an algorithm needs f(n) number of steps and one step takes t then you need t * f(n) for the algorithm.

    • 0