Question: Prove that if an algorithm has a time complexity of 3n 2 +10n+100, then it is O(n 2 ). [Hint: n is < n 2
Prove that if an algorithm has a time complexity of 3n2+10n+100, then it is O(n2). [Hint: n is < n2 for n>=2 and 100
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
