Pulsars
0 %
Log inSign up

Simplifying to Big-O

Short answer

An algorithm performs exactly 5n^2 + 100n + 3000 operations.

What is its complexity in Big-O notation? Write your answer in the form O(...).