Question
In algorithms, if T, for time complexity of an algorithm (calculated as number of steps/operations), in relations to problem input size, n, is: 𝑇 (𝑛) = 5𝑛^2 + 27𝑛 + 1005
What is the big-O time complexity?
O(n^2)
^^^ because in big-O we take the most significant part of the time complexity and ignore the smaller/less significant bits, as they will become irrelevent as n gets larger.

Question
In algorithms, if T, for time complexity of an algorithm (calculated as number of steps/operations), in relations to problem input size, n, is: 𝑇 (𝑛) = 5𝑛^2 + 27𝑛 + 1005
What is the big-O time complexity?
?

Question
In algorithms, if T, for time complexity of an algorithm (calculated as number of steps/operations), in relations to problem input size, n, is: 𝑇 (𝑛) = 5𝑛^2 + 27𝑛 + 1005
What is the big-O time complexity?
O(n^2)
^^^ because in big-O we take the most significant part of the time complexity and ignore the smaller/less significant bits, as they will become irrelevent as n gets larger.
If you want to change selection, open document below and click on "Move attachment"

#### pdf

owner: kkhosravi - (no access) - ProblemSolvingwithAlgorithmsandDataStructures.pdf, p49

#### Summary

status measured difficulty not learned 37% [default] 0

No repetitions