Answer:
polynomial-bounded algorithms
Explanation:
There are two algorithm complexities and they are time and space complexities. They can be denoted with the big-O notation. The big-o notation for a time and space complexity gets the worst-case time and space respectively.
The time complexity gets the measure of the execution time of an algorithm. When the time function is a polynomial ( k^n + k^n-1 ...) then the algorithm is said to be a polynomial-bounded algorithm.
It is a runtime error thart occurs when <span>the javascript interpreter encounters a problem while a program is executing.</span>
I would say D. But l may be incorrect. Al bots are not made for games, but are made for information.
Sorry l can't be much of help, but l do hope that I did help you out in a way.