Please run this code and rectify the issue in string #include #include int binarySearch(int arr[], int l, int r, int x) { if (r >= l) { int mid = l + (r - l) / 2; if (arr[mid] == x) return mid; if (arr[mid] > x) return binarySearch(arr, l, mid - 1, x); return binarySearch(arr, mid + 1, r, x); } return -1; } int binarySearchString(char arr[], int l, int r, char x) { if (r >= l) { int mid = l + (r - l) / 2; if (x == arr[mid]) return mid; if (x > (arr[mid])) return binarySearchString(arr, l, mid - 1, x); return binarySearchString(arr, mid + 1, r, x); } return -1; } int main(void) { // for intergers int n, x, arr[50]; printf("\nEnter the number of elements to be sorted : "); scanf("%d", &n); printf("Enter %d elements : ", n); for (int i = 0; i < n; i++) scanf("%d", &arr[i]); printf("\nEnter the element to be searched : "); scanf("%d", &x); int result = binarySearch(arr, 0, n - 1, x); (result == -1) ? printf("\nElement is not present in array") : printf("\nElement is present at index %d", result); printf("\n\n---------------------------------------------------------"); // for strings char str[30], ch; int len; printf("\n\nEnter the string : "); scanf("%char",&str); len = strlen(str); fflush(stdin); printf("\nEnter the character to be searched : "); scanf("%c", &ch); int res = binarySearchString(str, 0, len - 1, ch); (res == -1) ? printf("\nCharacter is not present in the string") : printf("\nCharacter is present in the string at index %d", res); return 0; }

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Related questions

Question

Please run this code and rectify the issue in string #include #include int binarySearch(int arr[], int l, int r, int x) { if (r >= l) { int mid = l + (r - l) / 2; if (arr[mid] == x) return mid; if (arr[mid] > x) return binarySearch(arr, l, mid - 1, x); return binarySearch(arr, mid + 1, r, x); } return -1; } int binarySearchString(char arr[], int l, int r, char x) { if (r >= l) { int mid = l + (r - l) / 2; if (x == arr[mid]) return mid; if (x > (arr[mid])) return binarySearchString(arr, l, mid - 1, x); return binarySearchString(arr, mid + 1, r, x); } return -1; } int main(void) { // for intergers int n, x, arr[50]; printf("\nEnter the number of elements to be sorted : "); scanf("%d", &n); printf("Enter %d elements : ", n); for (int i = 0; i < n; i++) scanf("%d", &arr[i]); printf("\nEnter the element to be searched : "); scanf("%d", &x); int result = binarySearch(arr, 0, n - 1, x); (result == -1) ? printf("\nElement is not present in array") : printf("\nElement is present at index %d", result); printf("\n\n---------------------------------------------------------"); // for strings char str[30], ch; int len; printf("\n\nEnter the string : "); scanf("%char",&str); len = strlen(str); fflush(stdin); printf("\nEnter the character to be searched : "); scanf("%c", &ch); int res = binarySearchString(str, 0, len - 1, ch); (res == -1) ? printf("\nCharacter is not present in the string") : printf("\nCharacter is present in the string at index %d", res); return 0; }

Expert Solution