A recursive function that performs a binary search
You return a boolean to indicate whether the value was found or not.  The function would be more useful if you returned an index at which the value was found (or -1 if not found).  It's better information for the same amount of work.

It appears that left is the leftmost index to consider, and right is the rightmost index to consider.  It would be more idiomatic to follow the convention of inclusive-exclusive bounds, with left being the leftmost index and right being just beyond the last element.  That way, right - left indicates the number of elements in the array.

You've implemented the search using recursion, but it could also be done using just a loop.  You would avoid the overhead of function calls and the possibility of stack overflow.

int mid = ( left + right ) / 2 is vulnerable to integer overflow if both indices are large.  int mid = left + (right - left) / 2 would not overflow.