How to search element in Float Array using Binary Search in Java?
Declaration :
1 |
public static int binarySearch(float[] a, float key) |
Explanation :
Purpose | The java.util.Arrays.binarySearch(float[] a float key) method searches the specified array of floats 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 |
package com.c4learn; import java.util.Arrays; public class ArrayDemo { public static void main(String[] args) { // Initialize unsorted float array float arr[] = { 5.1f, 10.1f, 20.1f, 15.1f }; // Sorting array Arrays.sort(arr); // Printing the sorted float array System.out.println("The sorted float array is:"); for (float num : arr) { System.out.println("Array Element is " + num); } // Enter the value to be searched float val = 15.1f; int returnV = Arrays.binarySearch(arr, val); System.out.println("The index of element 15.1 is : " + returnV); } } |
Output of Program :
1 2 3 4 5 6 |
The sorted float array is: Array Element is 5.1 Array Element is 10.1 Array Element is 15.1 Array Element is 20.1 The index of element 15.1 is : 2 |