Question: the aim is to design a solution for the searching...
The aim is to design a solution for the searching problem: A given value, v, is searched in a sorted array, A having the size n.
1. Design a first solution (Algorithm1) without recursion.
2. Compute the running time of Algorithm1.
3. Design a solution based on the idea of divide and conquer (Algorithm2)
4. Compute the running time of Algorithm2
5. Compare between Algorithm1 and algorithm2