- Java.util Package Classes
- Java.util - Home
- Java.util - ArrayDeque
- Java.util - ArrayList
- Java.util - Arrays
- Java.util - BitSet
- Java.util - Calendar
- Java.util - Collections
- Java.util - Currency
- Java.util - Date
- Java.util - Dictionary
- Java.util - EnumMap
- Java.util - EnumSet
- Java.util - Formatter
- Java.util - GregorianCalendar
- Java.util - HashMap
- Java.util - HashSet
- Java.util - Hashtable
- Java.util - IdentityHashMap
- Java.util - LinkedHashMap
- Java.util - LinkedHashSet
- Java.util - LinkedList
- Java.util - ListResourceBundle
- Java.util - Locale
- Java.util - Observable
- Java.util - PriorityQueue
- Java.util - Properties
- Java.util - PropertyPermission
- Java.util - PropertyResourceBundle
- Java.util - Random
- Java.util - ResourceBundle
- Java.util - ResourceBundle.Control
- Java.util - Scanner
- Java.util - ServiceLoader
- Java.util - SimpleTimeZone
- Java.util - Stack
- Java.util - StringTokenizer
- Java.util - Timer
- Java.util - TimerTask
- Java.util - TimeZone
- Java.util - TreeMap
- Java.util - TreeSet
- Java.util - UUID
- Java.util - Vector
- Java.util - WeakHashMap
- Java.util Package Extras
- Java.util - Interfaces
- Java.util - Exceptions
- Java.util - Enumerations
- Java.util Useful Resources
- Java.util - Useful Resources
- Java.util - Discussion
Java Arrays binarySearch() Method
Description
The Java Arrays binarySearch(short[] a, short key) method searches the specified array of shorts for the specified value using the binary search algorithm. The array must be sorted before making this call. If it is not sorted, the results are undefined.
Declaration
Following is the declaration for java.util.Arrays.binarySearch(short[] a, short key) method
public static int binarySearch(short[] a, short key)
Parameters
a − This is the array to be searched.
key − This is the value to be searched for.
Return Value
This method returns index of the search key, if it is contained in the array, else it returns (-(insertion point) - 1). The insertion point is the point at which the key would be inserted into the array: the index of the first element greater than the key, or a.length if all elements in the array are less than the specified key.
Exception
NA
Java Arrays binarySearch(short[] a, int fromIndex, int toIndex, short key) Method
Description
The Java Arrays binarySearch(short[] a, int fromIndex, int toIndex, short key) method searches a range of the specified array of shorts for the specified value using the binary search algorithm. The range must be sorted before making this call.If it is not sorted, the results are undefined.
Declaration
Following is the declaration for java.util.Arrays.binarySearch(short[] a, int fromIndex, int toIndex, short key) method
public static int binarySearch(short[] a, int fromIndex, int toIndex, short key)
Parameters
a − This is the array to be searched.
fromIndex − This is the index of the first element (inclusive) to be searched.
toIndex − This is the index of the last element (exclusive) to be searched.
key − This is the value to be searched for.
Return Value
This method returns index of the search key, if it is contained in the array, else it returns (-(insertion point) - 1). The insertion point is the point at which the key would be inserted into the array; the index of the first element in the range greater than the key, or toIndex if all elements in the range are less than the specified key.
Exception
IllegalArgumentException − if fromIndex > toIndex
ArrayIndexOutOfBoundsException − if fromIndex < 0 or toIndex > a.length
Performing Binary Search on short Array Example
The following example shows the usage of Java Arrays binarySearch(short[], key) method. First, we've created an array of shorts, sorted and printed them. Then binary search is performed on a value and result is printed.
package com.tutorialspoint; import java.util.Arrays; public class ArrayDemo { public static void main(String[] args) { // initializing unsorted short array short shortArr[] = {10,20,15,22,35}; // sorting array Arrays.sort(shortArr); // let us print all the elements available in list System.out.println("The sorted short array is:"); for (short number : shortArr) { System.out.println("Number = " + number); } // entering the value to be searched short searchVal = 35; int retVal = Arrays.binarySearch(shortArr,searchVal); System.out.println("The index of element 35 is : " + retVal); } }
Output
Let us compile and run the above program, this will produce the following result −
The sorted short array is: Number = 10 Number = 15 Number = 20 Number = 22 Number = 35 The index of element 35 is : 4
Performing Binary Search on Object Sub-Array Example
The following example shows the usage of Java Arrays binarySearch(short[], fromIndex, toIndex, key) method. First, we've created an array of shorts, sorted and printed them. Then binary search is performed on a value on sub array and result is printed.
package com.tutorialspoint; import java.util.Arrays; public class ArrayDemo { public static void main(String[] args) { // initializing unsorted short array short shortArr[] = {10,20,15,22,35}; // sorting array Arrays.sort(shortArr); // let us print all the elements available in list System.out.println("The sorted short array is:"); for (short number : shortArr) { System.out.println("Number = " + number); } // entering the value to be searched short searchVal = 35; // entering the range of index int retVal = Arrays.binarySearch(shortArr,2,5,searchVal); System.out.println("The index of element 35 is : " + retVal); } }
Output
Let us compile and run the above program, this will produce the following result −
The sorted short array is: Number = 10 Number = 15 Number = 20 Number = 22 Number = 35 The index of element 35 is : 4
Performing Binary Search on short Array for Non-Existing Value Example
The following example shows the usage of Java Arrays binarySearch(short[], key) method. First, we've created an array of shorts, sorted and printed them. Then binary search is performed on a value which is not present in the array and result is printed .
package com.tutorialspoint; import java.util.Arrays; public class ArrayDemo { public static void main(String[] args) { // initializing unsorted short array short shortArr[] = {10,20,15,22,35}; // sorting array Arrays.sort(shortArr); // let us print all the elements available in list System.out.println("The sorted short array is:"); for (short number : shortArr) { System.out.println("Number = " + number); } // entering the value to be searched short searchVal = 38; int retVal = Arrays.binarySearch(shortArr,searchVal); System.out.println("The index of element 38 is : " + retVal); } }
Output
Let us compile and run the above program, this will produce the following result −
The sorted short array is: Number = 10 Number = 15 Number = 20 Number = 22 Number = 35 The index of element 38 is : -6
To Continue Learning Please Login
Login with Google