Question: If an algorithm is expressed using the equation below, write the complexity using Big Oh notation. F(n) = 15n2 + 45n O(n2) O(15n2) O(n) O(45n)
If an algorithm is expressed using the equation below, write the complexity using "Big Oh" notation.
F(n) = 15n2 + 45n
| O(n2) |
| O(15n2) |
| O(n) |
| O(45n) |
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
