What is the worst-case and best-case Big-O for a P-complete problem?
a. O(n!) and O(1)
b. O(n^2) and O(n)
c. O(k^n) and O(n!)
d. O(n^n) and O(n!)
a. O(n!) and O(1)
O(n!) factorial is the worst case and O(1) constant is the best case.
Computer Science & Information Technology
You might also like to view...
What is the value of numbers.size() after the following code? vector
a. 0 b. 10 c. 100 d. unknown
Computer Science & Information Technology
Boolean operators are used to combine or modify relational operations.
Answer the following statement true (T) or false (F)
Computer Science & Information Technology