Programming in Python $$ Practice Problem $5$

Binary Search

Assume that you are given a sorted array of integers and an integer target from output. Write a binary search ONLY IN RECURSIVE to find the target in an array such that, if the target is NOT in the array, it will return $-1$; otherwise, it returns the index.

EXAMPLE:

Array $=[1,3,5,7,17,23,34,43,47,52]$

Target $=3$: returns $1$

Target $=12$: returns $-1$