FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
programming-contest/binarySearch.cpp at master · AshHasib/programming-contest · GitHub
AshHasib
/
programming-contest
Public
Notifications
You must be signed in to change notification settings
Fork
1
Star
1
Code
Issues
0
Pull requests
0
Actions
Projects
Security and quality
0
Insights
Additional navigation options
Code
Issues
Pull requests
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
programming-contest
/
binarySearch.cpp
Copy path
More file actions
More file actions
Latest commit
History
History
History
51 lines (40 loc) · 880 Bytes
Breadcrumbs
programming-contest
/
binarySearch.cpp
Copy path
File metadata and controls
51 lines (40 loc) · 880 Bytes
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
#
include
<
bits/stdc++.h
>
using
namespace
std
;
int
binarySearch
(
int
ar[],
int
l,
int
h,
int
key)
{
if
(l<=h)
{
int
mid=(l+h)/
2
;
if
(ar[mid]==key)
{
return
mid;
}
else
if
(ar[mid]<key)
{
return
binarySearch
(ar,mid+
1
,h,key);
}
else
{
return
binarySearch
(ar,l,mid-
1
,key);
}
}
return
-
999
;
}
int
main
()
{
int
A[
100
];
int
N,key;
printf
(
"
Enter the size of array:
"
);
scanf
(
"
%d
"
,&N);
printf
(
"
Enter elements:
"
);
for
(
int
i=
0
;i<N;i++)
{
scanf
(
"
%d
"
,&A[i]);
}
printf
(
"
Enter key value:
"
);
scanf
(
"
%d
"
,&key);
int
loc=
binarySearch
(A,
0
,N-
1
,key);
if
(loc!=-
999
)
printf
(
"
The element is in :%d
\n
"
,loc);
else
printf
(
"
Element not found
\n
"
);
return
0
;
}
Back
|
FazBrowse Home
|
New Git URL