I need help please Implement a function that uses binary search to find the inde

Question

I need help please

Implement a function that uses binary search to find the index position of a given value k in an array of integers whose elements are in strictly increasing order. It searches for a given value k in an array of integers. If the value is found, the function returns the index (or location) of the value in the array; otherwise it returns -1. For example, for v = (-2, 4, 5, 6, 8) and k = 1, the function returns -1; and for k = 6 it returns 3. A declaration of the function is given above. Include test code with assertions.

Explanation / Answer

Please find the required function below :

Related Questions

Navigate

• Browse (All)
• Browse I
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.