Question

hey what's polynomial timeo​

Answer 1

Explanation:

Where do you typically use the objects above

Answer 2

Explanation:

An algorithm is said to be of polynomial time if its running time is upper bounded by a polynomial expression in the size of the input for the algorithm, i.e., T(n) = O(nk) for some positive constant k.