Can induction, recursion and algorithm be used together and if so explain and provide an example where this could work.

1. List all the steps used by Algorithm 1 to find the maximum ofthelist1,8,12,9,11,2,14,5,10,4. 2

2. Can induction, recursion and algorithm be used together and if so explain and provide an example where this could work.

3. Use strong induction to show that if you can run one mile or two miles, and if you can always run two more miles once you have run a specified number of miles, then you can run any number of miles.

4. Use strong induction to show that all dominoes fall in an infinite arrangement of dominoes if you know that the first three dominoes fall, and that when a domino falls, the domino three farther down in the arrangement also falls.

Type of paper Academic level Subject area
Number of pages Paper urgency Cost per page:
 Total: