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
In regards to time complexity which will perform better ω(n4) or O(n3) ?
Answer : A. ω(n4)
Our site uses cookies. By using this site, you agree to the Privacy Policy and Terms of Use.