1int binarySearch(int arr[], int n, int target) {
2 int low = 0, high = n - 1;
3 while (low <= high) {
4 int mid = (low + high) / 2;
5 if (arr[mid] == target) return mid;
6 else if (arr[mid] < target) low = mid + 1;
7 else high = mid - 1;
8 }
9 return -1;
10}
