Hello Friends,
In this post,we will talk and learn about How to Write a Java program for binary search using the Iterative Approach?
Binary search is one of the search techniques. Which works efficiently on the sorted arrays or collection. Hence, in order to search an element in array or collection by using binary search techniques, we must ensure that the array or collection is sorted.
The binary search uses a divide and conquer algorithm in which, the arrays or collection is divided into two halves and the item is compared with the middle element of the collection. If the match is found for a given searching key then the location of the middle element is returned. Otherwise, we have to search into either of the halves depending upon the result produced through the match.
|
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 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 |
package com.kkjavatutorials.client; import java.util.Arrays; import java.util.Scanner; /** * Java program for Binary search using Iterative Approach * @author KK JavaTutorials * */ public class BinarySearchTest { public static void main(String[] args) { Scanner scanner = null; try { System.out.println("Enter input Array Size:"); scanner = new Scanner(System.in); int inputArraySize = scanner.nextInt(); int inputArray[] = new int[inputArraySize]; System.out.println("Enter " +inputArraySize+" Array Elements:"); for (int i = 0; i < inputArray.length; i++) { inputArray[i] = scanner.nextInt(); } Arrays.sort(inputArray); System.out.println("input Array::"); System.out.println(Arrays.toString(inputArray)); System.out.println("Enter Seach Key Element:"); int seachKey = scanner.nextInt(); int startIndex = 0; int lastIntex = inputArray.length-1; int seachKeyIndex = binarySearch(inputArray,startIndex,lastIntex,seachKey); if( seachKeyIndex != -1) System.out.println(seachKey +" found at index: "+seachKeyIndex); else System.out.println(seachKey +" not found in inputArray"); } catch (Exception e) { e.printStackTrace(); }finally { if(scanner != null) scanner.close(); } } //Method for Binary Search using Iterative Approach private static int binarySearch(int[] inputArray,int startIndex,int lastIntex, int seachKey) { while (startIndex <= lastIntex) { int middleIndex = (startIndex+lastIntex)/2; if(inputArray[middleIndex] == seachKey) return middleIndex; else if(seachKey < inputArray[middleIndex]) lastIntex = middleIndex-1; else startIndex = middleIndex+1; } return -1; } } |
Few Sample input/output of the above program:
Enter input Array Size:
6
Enter 6 Array Elements:
12
78
20
19
27
85
input Array::
[12, 19, 20, 27, 78, 85]
Enter Seach Key Element:
27
27 found at index: 3
Enter input Array Size:
5
Enter 5 Array Elements:
12
45
61
13
14
input Array::
[12, 13, 14, 45, 61]
Enter Seach Key Element:
123
You May Also Like:
What is Java Database Connectivity (JDBC)?
Types of JDBC drivers in java?
JDBC MySQL database Connection example
JDBC database connection using property resource(property file)
CRUD(Create,Read,Update and Delete) Operation using JDBC Statement
Reading data from database using JDBC Statement
CRUD(Create,Read,Update and Delete) Operation using JDBC PreparedStatement
That’s all about How to Write a Java program for binary search using the Iterative Approach?
If you have any feedback or suggestion please feel free to drop in below comment box.