Comparing performance of DP, Recursion and Iteration methods Instructions
1 Consider the following iterative solution of the Fibonacci problem:

Assume that you have an sorted array of records. assume that the length of the array (n) is known. give two different methods to search for a specific value in this array. you can use english or pseudo-code for your algorithm. what is the time complexity for each algorithm and why?

Some peer-to-peer networks have a server and some don't. true false

Your mother is sure that you were driving too fast because she knows a. when you arrived and the direction you came from. b. how long it took you to get home and how far you traveled. c. what time you left and how long it took you to get home. d. the direction you were driving and how far you traveled.