Multiple Choice
What is the Big-Oh of the function T(n) = n2 - 2n + 81?
A) O(1)
B) O(n)
C) O(n2)
D) O(n log n)
Correct Answer:
Verified
Related Questions
Q11: It is necessary to know exactly how
Q12: Which of the following will result in
Q13: When trying to develop and identify a
Q14: Inefficient coding will increase the running time,
Q15: Using the following code segment could help
Q17: Merge Sort is more efficient than Bubble
Q18: If the order of magnitude is n2
Q19: If the order of magnitude is log
Q20: A function f (n) is Big-Theta of
Q21: The pattern T(n) = 2k T(n /
Unlock this Answer For Free Now!
View this answer and more for free by performing one of the following actions
Scan the QR code to install the App and get 2 free unlocks
Unlock quizzes for free by uploading documents