Skip to content

Fix edge cases in IterativeBinarySearch implementation #7331

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
AbhiramSakha wants to merge 1 commit into
base: master
Choose a base branch
from
+17 −19
Open

Fix edge cases in IterativeBinarySearch implementation #7331

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
36 changes: 17 additions & 19 deletions src/main/java/com/thealgorithms/searches/IterativeBinarySearch.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -28,28 +28,26 @@ public final class IterativeBinarySearch implements SearchAlgorithm {
* @return the index of key in the array or -1 if not found
*/
@Override
public <T extends Comparable<T>> int find(T[] array, T key) {
int l;
int r;
int k;
int cmp;
public <T extends Comparable<T>> int find(T[] array, T key) {
if (array == null || array.length == 0) {
return -1;
}

l = 0;
r = array.length - 1;
int l = 0;
int r = array.length - 1;

while (l <= r) {
k = (l + r) >>> 1;
cmp = key.compareTo(array[k]);
while (l <= r) {
int mid = (l + r) >>> 1;
int cmp = key.compareTo(array[mid]);

if (cmp == 0) {
return k;
} else if (cmp < 0) {
r = --k;
} else {
l = ++k;
}
if (cmp == 0) {
return mid;
} else if (cmp < 0) {
r = mid - 1;
} else {
l = mid + 1;
}

return -1;
}

return -1;
}
Loading