Array_operation/Binary search.cpp at main · Ramasuper88/Array_operation · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
#include<iostream>
using namespace std;

int BinarySearch(int n,int A[],int l,int r,int data)
{

	while(l<r)
	{
		int mid=(l+r)/2;
	    if(data<A[mid])
	      r=mid-1;
	      else if(data==A[mid])
	      return mid;
	    else
	    l=mid+1;
	}
	return -1;
}

int main()
{   int n,data;
int l=0,r=n-1;
	int mid=(l+r)/2;
cout<<"Enter the size of array"<<"\n";
cin>>n;
	int A[n];
	cout<<"Enter the elements of array in sorted order:"<<"\n";
	for(int i=0;i<n;i++)
	{
		cin>>A[i];
	}
	cout<<"Enter the data you want to search:"<<"\n";
	cin>>data;
	int result=BinarySearch(n,A,0,n-1,data);
	result==-1 ? cout<<"Element not found" : cout<<"Element found at index: "<<result;
	return 0;
}


#include<iostream>
using namespace std;

int BinarySearch(int n,int A[],int l,int r,int data)
{

	while(l<r)
	{
		int mid=(l+r)/2;
	    if(data<A[mid])
	      r=mid-1;
	      else if(data==A[mid])
	      return mid;
	    else
	    l=mid+1;
	}
	return -1;
}

int main()
{   int n,data;
int l=0,r=n-1;
	int mid=(l+r)/2;
cout<<"Enter the size of array"<<"\n";
cin>>n;
	int A[n];
	cout<<"Enter the elements of array in sorted order:"<<"\n";
	for(int i=0;i<n;i++)
	{
		cin>>A[i];
	}
	cout<<"Enter the data you want to search:"<<"\n";
	cin>>data;
	int result=BinarySearch(n,A,0,n-1,data);
	result==-1 ? cout<<"Element not found" : cout<<"Element found at index: "<<result;
	return 0;
}


#include<iostream>
using namespace std;

int BinarySearch(int n,int A[],int l,int r,int data)
{

	while(l<r)
	{
		int mid=(l+r)/2;
	    if(data<A[mid])
	      r=mid-1;
	      else if(data==A[mid])
	      return mid;
	    else
	    l=mid+1;
	}
	return -1;
}

int main()
{   int n,data;
int l=0,r=n-1;
	int mid=(l+r)/2;
cout<<"Enter the size of array"<<"\n";
cin>>n;
	int A[n];
	cout<<"Enter the elements of array in sorted order:"<<"\n";
	for(int i=0;i<n;i++)
	{
		cin>>A[i];
	}
	cout<<"Enter the data you want to search:"<<"\n";
	cin>>data;
	int result=BinarySearch(n,A,0,n-1,data);
	result==-1 ? cout<<"Element not found" : cout<<"Element found at index: "<<result;
	return 0;
}


#include<iostream>
using namespace std;

int BinarySearch(int n,int A[],int l,int r,int data)
{

	while(l<r)
	{
		int mid=(l+r)/2;
	    if(data<A[mid])
	      r=mid-1;
	      else if(data==A[mid])
	      return mid;
	    else
	    l=mid+1;
	}
	return -1;
}

int main()
{   int n,data;
int l=0,r=n-1;
	int mid=(l+r)/2;
cout<<"Enter the size of array"<<"\n";
cin>>n;
	int A[n];
	cout<<"Enter the elements of array in sorted order:"<<"\n";
	for(int i=0;i<n;i++)
	{
		cin>>A[i];
	}
	cout<<"Enter the data you want to search:"<<"\n";
	cin>>data;
	int result=BinarySearch(n,A,0,n-1,data);
	result==-1 ? cout<<"Element not found" : cout<<"Element found at index: "<<result;
	return 0;
}