Algorithms/JavaAlgorithms
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

code clean

Browse Source
This commit is contained in:
Salvatore Gabriele La Greca 2018-04-08 20:05:00 +02:00 committed by GitHub
parent 1cb21915fe
commit c7f4f53a4b
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 8 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

16
Searches/IterativeBinarySearch.java
View File

@ -13,12 +13,12 @@ public final class IterativeBinarySearch {
/** /**
* This method implements an iterative version of binary search algorithm * This method implements an iterative version of binary search algorithm
* *
* @param a sorted array * @param array a sorted array
* @param the key to search in array * @param key the key to search in array
* *
* @return the index of key in the array or -1 if not found * @return the index of key in the array or -1 if not found
*/ */
public static <T extends Comparable<T>> int BS(T[] array, T key) { public static <T extends Comparable<T>> int binarySearch(T[] array, T key) {
int l, r, k, cmp; int l, r, k, cmp;
l = 0; l = 0;
@ -45,15 +45,15 @@ public final class IterativeBinarySearch {
Random rand = new Random(); Random rand = new Random();
int base = rand.nextInt(1000); int base = rand.nextInt(1000);
Integer[] array = new Integer[0xFFFF]; Integer[] array = new Integer[65535];
for (int i = 0; i < array.length; i++) { for (int i = 0; i < array.length; i++) {
array[i] = base + (i + 1); array[i] = base + (i + 1);
} }
Arrays.sort(array); //if needed //Arrays.sort(array); //if needed
Integer key = base + rand.nextInt(array.length); Integer key = base + rand.nextInt(array.length * 2); //can generate keys that aren't in array
System.out.println(BS(array, key)); System.out.println(binarySearch(array, key));
System.out.println(Arrays.binarySearch(array, key)); System.out.println(Arrays.binarySearch(array, key));
} }
} }