How to search element in Double Array using Binary Search in Java?
Declaration :
1 |
public static int binarySearch(double[] a, double key) |
Explanation :
Purpose | The java.util.Arrays.binarySearch(double[] a double key) method searches the specified array of doubles 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. |
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 Program : Example
Below example will explain java.util.Arrays.binarySearch() method.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 |
package com.c4learn; import java.util.Arrays; public class ArrayDemo4 { public static void main(String[] args) { // Initialize unsorted double array double arr[] = { 5.5, 4.4, 9.9, 2.2, 3.3 }; // Sorting array Arrays.sort(arr); // Printing Sorted Double Array System.out.println("The sorted double array is:"); for (double num : arr) { System.out.println("Array Element is " + num); } // Entering the value to be searched double val = 5.5; int index = Arrays.binarySearch(arr, val); System.out.println("The index of element 5.5 is : " + index); } } |
Output of Program :
1 2 3 4 5 6 7 |
The sorted double array is: Array Element is 2.2 Array Element is 3.3 Array Element is 4.4 Array Element is 5.5 Array Element is 9.9 The index of element 5.5 is : 3 |