Rotated sorted array binary search

int rotated_binary_search(int a[], int n, int target){int l = 0;int r = n - 1;while (l <= r){int m = l + (l + r) / 2;if (a[m] == target)return m;else if (a[l] < a[m]){if (a[l] <= target && target <= a[m])r = m - 1;elsel = m + 1;}else{if (a[m] <= target && target <= a[r])l = m + 1;elser = m - 1;}}return -1;};