91Ó°ÊÓ

Find the number of comparisons needed to search for \(k e y=13\) in each ordered list using the recursive binary search algorithm in Example 5.33 $$3,7,8,13,21$$

A person deposits \(\$ 1000\) in a bank at an annual interest rate of \(6 \% .\) Let \(A(n)\) denote the compound amount she will receive at the end of \(n\) interest periods. Define \(A(n)\) recursively if interest is compounded: Quarterly

Using generating functions, solve each LHRRWCC. $$a_{n}=2 a_{n-1}, a_{0}=1$$

Write an iterative algorithm to compute the \(n\) th Fibonacci number.

Find the number of comparisons needed to search for \(k e y=13\) in each ordered list using the recursive binary search algorithm in Example 5.33 $$15,16,19,21$$

Compute the maximum number of comparisons needed to search for a particular item in an ordered list containing the following number of items, using the recursive binary search algorithm. $$8$$

Mrs. Zee deposits \(A\) dollars at a bank at an annual interest rate of \(r \%\) compounded semiannually. Write a recursive algorithm to compute the compound amount she will receive at the end of \(n\) years.

A person deposits \(\$ 1000\) in a bank at an annual interest rate of \(6 \% .\) Let \(A(n)\) denote the compound amount she will receive at the end of \(n\) interest periods. Define \(A(n)\) recursively if interest is compounded: Monthly

Using generating functions, solve each LHRRWCC. $$a_{n}=a_{n-1}+2, a_{1}=1$$

Ned deposits a certain amount \(A_{0}\) in a bank at an annual interest rate of \(12 \%\) compounded annually. The compound amount he would receive at the end of \(n\) years is given by \(A_{n}=1.12 \mathrm{A}_{n-1},\) where \(n \geq 1 .\) Determine the initial deposit \(A_{0}\) if he would receive: \(\$ 1804.64\) at the end of 5 years.