Define a function named binarySearch that takes four parameters: arr, l, r, and x.

Use a while loop to keep iterating until l is less than or equal to r.

Calculate the mid index by adding l and r and dividing the sum by 2. Use integer division toget an integer result.

Check if the element at the mid index of the array is equal to x. If it is, return mid.

If the element at the mid index is less than x, set l to mid + 1.

If the element at the mid index is greater than x, set r to mid - 1.

If the loop finishes and the element is not found, return -1