Using C++;

Binary search. Write a function that given an sorted array of integers A (ascending order) and an integer value x, searches for the x in A using binary search. The function returns the index where the value of x is found, and -1 if it is not found. Furthermore, the function should return the number of comparisons it performs.

int binSearch(int x, int A[], int size, int &numComp);