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; }
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...
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
![](/static/compass_v2/shared-icons/check-mark.png)
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Recommended textbooks for you
![Computer Networking: A Top-Down Approach (7th Edi…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
![Computer Organization and Design MIPS Edition, Fi…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
![Network+ Guide to Networks (MindTap Course List)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
![Computer Networking: A Top-Down Approach (7th Edi…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
![Computer Organization and Design MIPS Edition, Fi…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
![Network+ Guide to Networks (MindTap Course List)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
![Concepts of Database Management](https://www.bartleby.com/isbn_cover_images/9781337093422/9781337093422_smallCoverImage.gif)
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
![Prelude to Programming](https://www.bartleby.com/isbn_cover_images/9780133750423/9780133750423_smallCoverImage.jpg)
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
![Sc Business Data Communications and Networking, T…](https://www.bartleby.com/isbn_cover_images/9781119368830/9781119368830_smallCoverImage.gif)
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY