Based on the data provided in the table below, the algorithm can be said to run in a reasonable time.
What is an algorithm?
An algorithm can be defined as a standard formula (procedures) which comprises series of finite steps and instructions that is used for proffering solutions to a problem on a computer under appropriate conditions.
In Computer science, the runtime of an algorithm is broadly classified into two (2) main types and these include:
- Unreasonable time (Exponential).
- Reasonable time (polynomial).
Based on the data provided in the table below, the algorithm can be said to run in a reasonable time because it has a polynomial efficiency.
Read more on algorithm here: brainly.com/question/24793921
