A code with θ(n) and θ(n2) complexity. Which code will execute faster for a code of size J ?
Answer : C. Cant be said as size of K is unknown
Browse Tag
o(n) always faster than o(n^2)
1 Article
Our site uses cookies. By using this site, you agree to the Privacy Policy and Terms of Use.
We have detected that you are using extensions to block ads. Please support us by disabling these ads blocker.
