Tag: running time of algorithm

Questions Related to running time of algorithm

Let w(n) and A(n) denote respectively, the worst case and average case running time of an algorithm executed on an input of size n. which of the following is ALWAYS TRUE?

A. A(n)= Ω W(n) B. A(n)= O W(n) C. A(n)= Ѳ W(n) D. A(n)= o W(n)
running time of algorithm

  1. A(n) = $\omega$ W(n)

  2. A(n) = $O$ W(n)

  3. A(n) = $\theta$ W(n)

  4. A(n) = o W(n)

Show answer
Correct Option: B

Let w(n) and A(n) denote respectively, the worst case and average case running time of an algorithm executed on an input of size n. which of the following is ALWAYS TRUE?

running time of algorithm

  1. A(n) = $\Omega$ W(n)

  2. A(n) = $O$ W(n)

  3. A(n) = $\Theta$ W(n)

  4. A(n) = o W(n)

Show answer
Correct Option: B