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?
Answer
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?
Answer
?
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?
Answer
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
not learned
measured difficulty
37% [default]
last interval [days]
repetition number in this series
0
memorised on
scheduled repetition
scheduled repetition interval
last repetition or drill
Details
No repetitions
Discussion
Do you want to join discussion? Click here to log in or create user.