Given a sorted integer array A and an integer x, Derive a divide and conquer algorithm that returns the index of x’s fir
Posted: Fri Jul 01, 2022 5:47 am
Given a sorted integer array A and an integer x, Derive a divideand conquer algorithm that returns the index of x’s firstoccurrence. If the x is not present in the array, report that aswell. Derive the runtime and justify the correctness.