int arr[] = {2, 3, 4, 10, 40}
int x = 10
int result = binarySearch(arr, x)
if result == -1
	print("Element not present")
else
	print("Element found at index " + result)
]

// Search for element 'x' in array 'arr'
int binarySearch(int[] arr, int x)
	int l = 0
	int r = #arr - 1
	while l <= r
		int m = l + (r - l) / 2
		
		if arr[m] = x
			return m
		]
		
		if arr[m] < x
			l = m + 1
		else
			r = m - 1
		]
	]
	return -1
]