Skip to content

Commit 05f73e1

Browse files
ashwektstreamDOTh
authored andcommitted
Fix binary search (#394)
1 parent 6bceb9c commit 05f73e1

File tree

3 files changed

+3
-3
lines changed

3 files changed

+3
-3
lines changed

Searching/Binary Search/C++/BinarySearch.cpp

+1-1
Original file line numberDiff line numberDiff line change
@@ -19,7 +19,7 @@ int binarySearch(int itemList[],int itemListSize,int item)
1919
int leftIndex = 0;
2020
int rightIndex = itemListSize;
2121
int middleIndex;
22-
while (leftIndex <= rightIndex)
22+
while (leftIndex < rightIndex)
2323
{
2424
middleIndex = (leftIndex+rightIndex)/2;
2525
if (itemList[middleIndex] < item)

Searching/Binary Search/C/BinarySearch.c

+1-1
Original file line numberDiff line numberDiff line change
@@ -19,7 +19,7 @@ int binarySearch(int itemList[],int itemListSize,int item)
1919
int leftIndex = 0;
2020
int rightIndex = itemListSize;
2121
int middleIndex;
22-
while (leftIndex <= rightIndex)
22+
while (leftIndex < rightIndex)
2323
{
2424
middleIndex = (leftIndex+rightIndex)/2;
2525
if (itemList[middleIndex] < item)

Searching/Binary Search/Python/BinarySearch.py

+1-1
Original file line numberDiff line numberDiff line change
@@ -8,7 +8,7 @@ def binary_search(item_list,item):
88
right_index = len(item_list)-1
99

1010
while left_index <= right_index:
11-
middle_index = (left_index+right_index) / 2
11+
middle_index = (left_index+right_index) // 2
1212
if item_list[middle_index] < item:
1313
left_index=middle_index+1
1414
elif item_list[middle_index] > item:

0 commit comments

Comments
 (0)