KEYWORDS: array, for, nested loops. LAB EXERCISE: Program 1: Write a program for implementation of Binary search using function. B c\Users\Umar\Desktop\cppproj\Debu. Enter 5 Nunbers in ascending order : c\Users\Umar\Desktop\cppproj\Debu.OO Enter 5 Nunbers in ascending order : 45 88 65 Enter iten to be searched : 12 Elenent not found Press any key to continue Enter iten to be searched : Elenent found at index - 1 Press any key to continue . Sample Output: Program 1
KEYWORDS: array, for, nested loops. LAB EXERCISE: Program 1: Write a program for implementation of Binary search using function. B c\Users\Umar\Desktop\cppproj\Debu. Enter 5 Nunbers in ascending order : c\Users\Umar\Desktop\cppproj\Debu.OO Enter 5 Nunbers in ascending order : 45 88 65 Enter iten to be searched : 12 Elenent not found Press any key to continue Enter iten to be searched : Elenent found at index - 1 Press any key to continue . Sample Output: Program 1
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
Solve with Another way, not like the second Picture 
![4G !!:
97:32
#include <iostream>
using namespace std;
int binarySearch (int arr[], int l, int r, int x)
{
if (r >= 1)
{
int mid = l + (r - 1) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch (arr, 1, mid - 1, x);
return binarySearch (arr, mid + 1, r, x);
return -1;
int main()
cout << "\n\n";
int arr[5];
int x;
int n = sizeof (arr) / sizeof (arr[0]);
cout<<"Enter 5 numbers in ascending order : \n";
for (int i = 0;i<5;i++)](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F427e0b1c-1947-4e3b-90dd-7f3c453537e8%2Ff1d5a24a-b17a-48b0-9fff-9a13db52b82e%2Fzaymdn9_processed.jpeg&w=3840&q=75)
Transcribed Image Text:4G !!:
97:32
#include <iostream>
using namespace std;
int binarySearch (int arr[], int l, int r, int x)
{
if (r >= 1)
{
int mid = l + (r - 1) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch (arr, 1, mid - 1, x);
return binarySearch (arr, mid + 1, r, x);
return -1;
int main()
cout << "\n\n";
int arr[5];
int x;
int n = sizeof (arr) / sizeof (arr[0]);
cout<<"Enter 5 numbers in ascending order : \n";
for (int i = 0;i<5;i++)
![KEYWORDS:
array, for, nested loops.
LAB EXERCISE:
Program 1:
a program for implementation of Binary search using function.
Write
I c:\Users\Umar\Desktop\cppproj\Debu.
Enter 5 Nunbers in ascending order :
c\Users\Umar\Desktop\cppproj\Debu.OO
Enter 5 Nunbers in ascending order :
45
67
88
65
Enter item to be searched :
12
Elenent not found
Press any key to continue
Enter iten to be searched :
Elenent found at index ▪ 1
Press any key to continue
Sample Output: Program 1](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F427e0b1c-1947-4e3b-90dd-7f3c453537e8%2Ff1d5a24a-b17a-48b0-9fff-9a13db52b82e%2F5tonm0c_processed.jpeg&w=3840&q=75)
Transcribed Image Text:KEYWORDS:
array, for, nested loops.
LAB EXERCISE:
Program 1:
a program for implementation of Binary search using function.
Write
I c:\Users\Umar\Desktop\cppproj\Debu.
Enter 5 Nunbers in ascending order :
c\Users\Umar\Desktop\cppproj\Debu.OO
Enter 5 Nunbers in ascending order :
45
67
88
65
Enter item to be searched :
12
Elenent not found
Press any key to continue
Enter iten to be searched :
Elenent found at index ▪ 1
Press any key to continue
Sample Output: Program 1
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 4 steps with 3 images
![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