backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-04-01 17:52:40 +08:00
Code Issues Projects Releases Wiki Activity

Merge pull request #734 from faizanahamed1414/patch-2

Browse Source 
error in line 23 i.e a constant value
This commit is contained in:
Anup Kumar Panwar
2020-05-23 00:01:16 +05:30
committed by GitHub
parent b59b70718d 948348a4d8
commit 22a5e863fd
3 changed files with 35 additions and 37 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
DIRECTORY.md
View File

@@ -162,7 +162,7 @@
* [Segtree](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/range_queries/segTree.cpp)
## Search
* [Binary Search](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/search/Binary%20Search.cpp)
* [Binary Search](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/search/binary_search.cpp)
* [Exponential Search](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/search/exponential_search.cpp)
* [Hash Search](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/search/hash_search.cpp)
* [Interpolation Search](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/search/Interpolation%20Search.cpp)

36
search/Binary Search.cpp
View File

@@ -1,36 +0,0 @@
#include <iostream>
using namespace std;
int binary_search(int a[], int l, int r, int key)
{
while (l <= r)
{
int m = l + (r - l) / 2;
if (key == a[m])
return m;
else if (key < a[m])
r = m - 1;
else
l = m + 1;
}
return -1;
}
int main(int argc, char const *argv[])
{
int n, key;
cout << "Enter size of array: ";
cin >> n;
cout << "Enter array elements: ";
int a[n];
for (int i = 0; i < n; ++i)
{
cin >> a[i];
}
cout << "Enter search key: ";
cin >> key;
int res = binary_search(a, 0, n - 1, key);
if (res != -1)
cout << key << " found at index " << res << endl;
else
cout << key << " not found" << endl;
return 0;
}

34
search/binary_search.cpp Normal file
View File

@@ -0,0 +1,34 @@
#include <iostream>
// binary_search function
int binary_search(int a[], int l, int r, int key) {
while (l <= r) {
int m = l + (r - l) / 2;
if (key == a[m])
return m;
else if (key < a[m])
r = m - 1;
else
l = m + 1;
}
return -1;
}
int main(int argc, char const* argv[]) {
int n, key;
std::cout << "Enter size of array: ";
std::cin >> n;
std::cout << "Enter array elements: ";
int* a = new int[n];
// this loop use for store value in Array
for (int i = 0; i < n; i++) {
std::cin >> a[i];
}
std::cout << "Enter search key: ";
std::cin >> key;
// this is use for find value in given array
int res = binary_search(a, 0, n - 1, key);
if (res != -1)
std::cout << key << " found at index " << res << std::endl;
else
std::cout << key << " not found" << std::endl;
return 0;
}