A code with θ(n) and θ(n2) complexity. Which code will execute faster for a code of size J ?



A code with θ(n) and θ(n2) complexity . Which code will execute faster for a code of size J ?

A. θ(n)

B. θ(n2)

C. Cant be said as size of K is unknown

D. Both will be equal

Answer : C. Cant be said as size of K is unknown


Explanation :

    Cant be determined as the size of K is not known.


Related Searches to A code with θ(n) and θ(n2) complexity. Which code will execute faster for a code of size J ?