mirror of
https://github.com/TheAlgorithms/Java.git
synced 2025-07-26 05:59:22 +08:00
Code cleanup (#4246)
This commit is contained in:
@ -33,6 +33,7 @@ public class LinearSearchThread {
|
||||
}
|
||||
boolean found = t.getResult() || t1.getResult() || t2.getResult() || t3.getResult();
|
||||
System.out.println("Found = " + found);
|
||||
in.close();
|
||||
}
|
||||
}
|
||||
|
||||
|
@ -21,9 +21,8 @@ class PerfectBinarySearch {
|
||||
}
|
||||
|
||||
public static void main(String[] args) {
|
||||
PerfectBinarySearch BinarySearch = new PerfectBinarySearch();
|
||||
int[] array = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
|
||||
assert BinarySearch.binarySearch(array, -1) == -1;
|
||||
assert BinarySearch.binarySearch(array, 11) == -1;
|
||||
assert PerfectBinarySearch.binarySearch(array, -1) == -1;
|
||||
assert PerfectBinarySearch.binarySearch(array, 11) == -1;
|
||||
}
|
||||
}
|
||||
|
@ -1,7 +1,5 @@
|
||||
package com.thealgorithms.searches;
|
||||
|
||||
import java.util.Arrays;
|
||||
|
||||
public class SearchInARowAndColWiseSortedMatrix {
|
||||
/**
|
||||
* Search a key in row and column wise sorted matrix
|
||||
|
@ -27,6 +27,7 @@ public class SquareRootBinarySearch {
|
||||
int num = sc.nextInt();
|
||||
long ans = squareRoot(num);
|
||||
System.out.println("The square root is : " + ans);
|
||||
sc.close();
|
||||
}
|
||||
|
||||
/**
|
||||
|
@ -1,5 +1,4 @@
|
||||
package com.thealgorithms.searches;
|
||||
import java.util.*;
|
||||
public class sortOrderAgnosticBinarySearch {
|
||||
public static int find(int[] arr, int key) {
|
||||
int start = 0;
|
||||
|
Reference in New Issue
Block a user