Question: Devise a recursive algorithm to find the number 2, if present, in sorted list (a1, 22, ..., an). Prove your algorithm is correct and prove

Devise a recursive algorithm to find the number 2, if present, in sorted list (a1, 22, ..., an). Prove your algorithm is correct and prove its runtime is (log n)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
