Question: In all the algorithms, always explain (more precisely try to prove) the correctness of your algorithm You always must analyze the running time of any
In all the algorithms, always explain (more precisely try to prove) the correctness of your algorithm You always must analyze the running time of any algorithm. The time complexity should be as small as possible.

Question 2: Given a sorted array A of n numbers and an additional number 2, give an algorithm that checks if there is i so that (A[i])2 = x Example: Say that A = and x = 400. Then the answer is yes as 202 = 400. If x = 49 the answer is no since 7 A
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
