Skip to content

Commit b6d1270

Browse files
authored
Merge pull request #42 from Shoaib19/Shoaib019
searching algos done for now
2 parents 306645c + ad1ef00 commit b6d1270

File tree

2 files changed

+18
-10
lines changed

2 files changed

+18
-10
lines changed

searching_algos/binary_search.cpp

Lines changed: 9 additions & 10 deletions
Original file line numberDiff line numberDiff line change
@@ -1,22 +1,21 @@
11
int binary_search(int arr[],int size, int key)
22
{
3-
int low = 0;
3+
int low, mid = 0;
44
int high = size - 1;
5-
65
while(low <= high)
76
{
8-
mid = low + (high - low) / 2;
9-
// start from here
7+
mid = low + (high - low) / 2;
8+
if(arr[mid] == key)
9+
return mid;
10+
1011
if(key < arr[mid])
1112
{
12-
high = mid;
13-
mid = low + high / 2;
13+
high = mid - 1;
1414
}
15-
else if(key > arr[mid])
15+
else
1616
{
17-
low = mid;
18-
mid = low + high / 2;
17+
low = mid + 1;
1918
}
2019
}
21-
return (arr[mid] == key) ? mid : -1;
20+
return -1;
2221
}

searching_algos/linear_search.cpp

Lines changed: 9 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,9 @@
1+
int linear_search(int arr[],int size, int key)
2+
{
3+
for(int i = 0; i < size; i++)
4+
{
5+
if(arr[i] == key)
6+
return i;
7+
}
8+
return -1;
9+
}

0 commit comments

Comments
 (0)