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 was called Futureworld
It was published in 1976, it was the first animation that using 3D computer graphics for its animated hand and face.
But they still used 2D digital composting to materialize characters over a background
Answer:
1.enhace the speed and accuracy of work
2.Large historical data can be stored easily for future use.
3.Quick calculation and display of graphical and mathematical data.
