Algorithm 8: Computing the power of a number Input:r, is a real number a E R, n is an integer number, n e Z Output: a" 1: р+1 2: for i +1 ton do 3: p px x 4: end for 5. return n

T/F 11. A recursion will still be replaced by an iteration and the other way around.

Please help Report - III. Do not copy other solutions. Please write your own words to avoid doing same with others.

Design and implement an algorithm using recursion and backtracking to sort an array of integers into ascending order. Consider the given array as input and produce a sorted array as output. Each time you take an integer from the input array, place it at the end of the output array. If the result is unsorted, backtrack.

To determine the nth order Fibonacci sequence number, create a recursive algorithm.To keep track of the variables involved in the recursion, include the proper input/output statements. Are you able to see the "invisible" array in action? Keep a record of your findings.

Divide and Conquer is one of the important design method for Algorithm. What is the major feature to design an algorithm applying the Divide and Conquer idea ? 單選: a. Recursive in Assign, Calculate, Output. O b. Recursive in Assign, Divide, Conquer. O c. Recursive in Divide, Calculate, Combine. d. Recursive in Divide, Conquer, Combine. e. Recursive in Calculate, Conquer, Combine. We call it as 3C.

1. A certain computer algorithm executes four times as many operations when it is run with an input of size n as when it is run with an input of size n – 1. Here, n > 1 is an integer. When the algorithm is run with an input of size 1, it executes 12 operations. How many operations does the algorithm execute when it is run with an input of size 5? How many operations does the algorithm execute when it is run with an input of size n?