Answer:
13:a. 15:c. 14:Unknown answer
Answer:
Recursive solutions can be less efficient than their iterative counterparts
Explanation:
Recursion can be defined or described as a method of solving a problem where the solution depends on solutions to smaller instances of the same problem.
It entails using iteration to ensure that smaller parts of a solution are satisfied towards solving thw overall problem.
Ita major disadvantage seems to be that it seem to be less efficient than their iterative counterparts. This is as a result of concentrating on trying to solve a smaller instances.
Answer:
an algorithm (pronounced AL-go-rith-um) is a procedure or formula for solving a problem, based on conducting a sequence of specified actions. A computer program can be viewed as an elaborate algorithm. In mathematics and computer science, an algorithm usually means a small procedure that solves a recurrent problem.
