-
Notifications
You must be signed in to change notification settings - Fork 0
/
question_01.cpp
52 lines (40 loc) · 1012 Bytes
/
question_01.cpp
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
/*
==> Binary Search <==
Question Link:- https://practice.geeksforgeeks.org/problems/binary-search-1587115620/1?page=1&difficulty[]=-1&category[]=Arrays&sortBy=submissions
Given a sorted array of size N and an integer K, find the position
at which K is present in the array using binary search.
Example 1:
Input:
N = 5
arr[] = {1 2 3 4 5}
K = 4
Output: 3
Explanation: 4 appears at index 3.
Example 2:
Input:
N = 5
arr[] = {11 22 33 44 55}
K = 445
Output: -1
Explanation: 445 is not present.
*/
#include <iostream>
using namespace std;
int binarysearch(int arr[], int n, int k) {
int s = 0, e = n-1;
while ( s <= e ) {
int m = (s + e) / 2;
if ( arr[m] == k )
return m;
else if ( arr[m] > k )
e = m - 1;
else
s = m + 1;
}
return -1;
}
int main () {
int arr[] = { 1, 2, 3, 4, 5 };
cout << binarysearch(arr, 5, 4);
return 0;
}