We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
2 parents b8d3a07 + d3d1d03 commit 678eee8Copy full SHA for 678eee8
src/com/jwetherell/algorithms/search/BinarySearch.java
@@ -56,6 +56,7 @@ private static int recursiveFind(int value, int start, int end, boolean optimize
56
}
57
58
private static final int linearSearch(int value, int start, int end) {
59
+ // From index i = start to i = end check if value matches sorted[i]
60
for (int i = start; i <= end; i++) {
61
int iValue = sorted[i];
62
if (value == iValue)
0 commit comments