gq: Upper and lower bounds are usually stated using the big O notation, which hides constant factors and smaller terms. This makes the bounds independent of the specific details of the computational model used. For instance, if T(n) = 7n2 + 15n + 40, in big O notation one would write T(n) = O(n2).
Question: What expression is generally used to convey upper or lower bounds? Question: What does a big O notation hide? Question: Big O notation provides autonomy to upper and lower bounds with relationship to what? Question: How would one write T(n) = 7n2 + 15n + 40 in big O notation?