Skip to content

Add iterative implementation alongside recursive BinarySearch #7359

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

Closed
Mudita-Singh wants to merge 6 commits into from
+34 −8
Closed

Add iterative implementation alongside recursive BinarySearch #7359

Changes from 1 commit
Commits
Show all changes
6 commits
Select commit Hold shift + click to select a range
df28478
Add iterative implementation of binary search
Mudita-Singh Apr 1, 2026
89189e5
Enhance IterativeBinarySearch with null safety and improved documenta…
Mudita-Singh Apr 1, 2026
cfc0963
Enhance IterativeBinarySearch with null safety and improved documenta…
Mudita-Singh Apr 1, 2026
6123598
Add null key and null array test cases for IterativeBinarySearch
Mudita-Singh Apr 2, 2026
ab522e8
Fix formatting: remove extra blank lines to pass clang linter
Mudita-Singh Apr 2, 2026
1ffcdf7
Fix: add newline at end of file
Mudita-Singh Apr 2, 2026
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
Prev Previous commit
Next Next commit
Fix formatting: remove extra blank lines to pass clang linter
  • Loading branch information
@Mudita-Singh
Mudita-Singh committed Apr 2, 2026
commit ab522e80b8c508cbd7fb4b1fa562ca8b10c59230
3 changes: 0 additions & 3 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 @@ -33,7 +33,6 @@ public final class IterativeBinarySearch implements SearchAlgorithm {
*/
@Override
public <T extends Comparable<T>> int find(T[] array, T key) {

// Handle edge cases: null/empty array or null key
// Prevents NullPointerException during comparison
if (array == null || array.length == 0 || key == null) {
Expand All @@ -44,11 +43,9 @@ public <T extends Comparable<T>> int find(T[] array, T key) {
int right = array.length - 1;

while (left <= right) {

// Use unsigned right shift to avoid overflow
// Equivalent to (left + right) / 2 but safer for large indices
int mid = (left + right) >>> 1;

int cmp = key.compareTo(array[mid]);

if (cmp == 0) {
Expand Down
Loading