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
algorithm – Big O
1 Article
Our site uses cookies. By using this site, you agree to the Privacy Policy and Terms of Use.