algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2025-07-06 00:54:32 +08:00
Code Issues Packages Projects Releases Wiki Activity

Add tests, remove main in IterativeBinarySearch (#5667)

Browse Source
This commit is contained in:
Hardik Pawar
2024-10-11 01:11:07 +05:30
committed by GitHub
parent ba3d3bf54e
commit 0a7065df38
3 changed files with 118 additions and 22 deletions
Download Patch File Download Diff File Expand all files Collapse all files

22
src/main/java/com/thealgorithms/searches/IterativeBinarySearch.java
View File

@ -1,9 +1,6 @@
package com.thealgorithms.searches;
import com.thealgorithms.devutils.searches.SearchAlgorithm;
import java.util.Arrays;
import java.util.Random;
import java.util.stream.Stream;
/**
* Binary search is one of the most popular algorithms This class represents
@ -55,23 +52,4 @@ public final class IterativeBinarySearch implements SearchAlgorithm {
return -1;
}
// Only a main method for test purpose
public static void main(String[] args) {
Random r = new Random();
int size = 100;
int maxElement = 100000;
Integer[] integers = Stream.generate(() -> r.nextInt(maxElement)).limit(size).sorted().toArray(Integer[] ::new);
// the element that should be found
Integer shouldBeFound = integers[r.nextInt(size - 1)];
IterativeBinarySearch search = new IterativeBinarySearch();
int atIndex = search.find(integers, shouldBeFound);
System.out.printf("Should be found: %d. Found %d at index %d. An array length %d%n", shouldBeFound, integers[atIndex], atIndex, size);
int toCheck = Arrays.binarySearch(integers, shouldBeFound);
System.out.printf("Found by system method at an index: %d. Is equal: %b%n", toCheck, toCheck == atIndex);
}
}