An algorithm whose worst-case time complexity is bounded above by a polynomial function of its size is called a(n)

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.

basic (beginner's all-purpose symbolic instruction code)[1] is a family of general-purpose, high-level programming languages whose design philosophy emphasizes ease of use.