Saved Bookmarks
| 1. |
If for an algorithm time complexity is given by O(n^2) then complexity will ___________(a) constant(b) quadratic(c) exponential(d) none of the mentionedI got this question in unit test.My question is based upon Algorithms topic in chapter Algorithms of Discrete Mathematics |
| Answer» | |