- Java Basic Programs
- Java Programming Examples
- Java Print Hello World
- Java Get Input from User
- Java Print Integer
- Java Add two Numbers
- Java Check Even or Odd
- Java Check Prime or Not
- Java Check Alphabet or Not
- Java Check Vowel or Not
- Check Reverse equal Original
- Java Fahrenheit to Celsius
- Java Celsius to Fahrenheit
- Java Perfect Number Program
- Java Find Quotient Remainder
- Java Days to Seconds
- Java Count Digits in Number
- Java Binary Number Addition
- Java Discount Program
- Java Compute Courier Charge
- Java Find Telephone Bill
- Java Print ASCII Values
- Java Check Palindrome or Not
- Java Check Armstrong or Not
- Generate Armstrong Numbers
- Add two Numbers using Pointers
- Java Mathematical Programs
- Add Subtract Multiply & Divide
- Java Make Calculator
- Java Add Digits of Number
- Java Check Leap Year or Not
- Java Check Divisibility
- Java Find Simple Interest
- Java Find Compound Interest
- Java Print Fibonacci Series
- Java Find nCr nPr
- Calculate Average & Percentage
- Java Calculate Arithmetic Mean
- Java Calculate Student Grade
- Java Print Table of Number
- Java Print Prime Numbers
- Java Add n Numbers
- Java Interchange two Numbers
- Java Reverse Numbers
- Java Swap two Numbers
- Count Positive Negative & Zero
- Find Largest of two Numbers
- Find Largest of three Numbers
- Java Find Factorial of Number
- Java Find HCF & LCM
- Area & Perimeter of Square
- Area & Perimeter of Rectangle
- Area & Circumference of Circle
- Java Conversion Programs
- Java Decimal to Binary
- Java Decimal to Octal
- Java Decimal to Hexadecimal
- Java Binary to Decimal
- Java Binary to Octal
- Java Binary to Hexadecimal
- Java Octal to Decimal
- Java Octal to Binary
- Java Octal to Hexadecimal
- Java Hexadecimal to Decimal
- Java Hexadecimal to Binary
- Java Hexadecimal to Octal
- Java Pattern Programs
- Java Pattern of Stars
- Java Pattern of Alphabets
- Java Pattern of Numbers
- Java Pyramid of Stars
- Java Pyramid of Alphabets
- Java Pyramid of Numbers
- Java Print Diamond Pattern
- Java Print Floyd Triangle
- Java Print Pascal Triangle
- Java Array Programs
- One Dimensional Array Program
- Java Linear Search
- Java Binary Search
- Find Largest Element in Array
- Find Smallest Element in Array
- Java Reverse Array
- Insert Element in Array
- Delete Element from Array
- Java Merge two Array
- Java Bubble Sort
- Java Selection Sort
- Java Insertion Sort
- Java Find Common Elements
- Java Count Even/Odd Number
- Two Dimensional Array Program
- Java Add two Matrices
- Java Subtract two Matrices
- Java Transpose Matrix
- Multiply two Matrices
- Three Dimension Array Program
- Java String Programs
- Java Print String
- Find Length of String
- Java Compare two String
- Java Copy String
- Java Concatenate String
- Java Reverse String
- Delete Vowels from String
- Delete Words from Sentence
- Find Occurrence of a Character
- Java Find Occurrence of a Word
- Occurrence of Each Character
- Java Occurrence of Each Word
- Java Count Repeated Characters
- Java Count Repeated Words
- Java Capitalize Each Word
- Java Count Vowels/Consonants
- Java Extract Numbers
- Java Count Word in String
- Remove Spaces from String
- Java Sort a String
- Java Uppercase to Lowercase
- Java Lowercase to Uppercase
- Java Swap two Strings
- Java Check Anagram or Not
- Java Check Balance Parentheses
- Java Check Password Strength
- Java File Programs
- Java Read File
- Java Write to File
- Read & Display File Content
- Java Copy File
- Java Append Text to File
- Java Merge two File
- List files in Directory
- Java Delete File
- Java Miscellaneous Programs
- Generate Random Numbers
- Java Print Time & Date
- Java Get IP Address
- Java Shutdown Computer
- Java Programming Tutorial
- Java Tutorial
Java Program - Binary Search
This article is created to cover a program in Java that performs binary search. That is, the program searches an element using binary search technique.
If you're not aware about, How binary search works ?
Then refer to Binary Search Logic and Algorithm. Now let's move on, and
create a program in Java for binary search.
Binary Search in Java - Basic Version
The question is, write a Java program to perform binary search based on 10 elements. All the 10 elements and the element to search using binary search, must be received by user at run-time of the program. The program given below is the answer to this question:
import java.util.Scanner; public class fresherearth { public static void main(String[] args) { int size=10, i, search, first, last, middle; int[] arr = new int[size]; Scanner scan = new Scanner(System.in); System.out.print("Enter 10 Elements (in Ascending): "); for(i=0; i<size; i++) { arr[i] = scan.nextInt(); } System.out.print("Enter an Element to Search: "); search = scan.nextInt(); first = 0; last = size-1; middle = (first+last)/2; while(first<=last) { if(arr[middle]<search) { first = middle+1; } else if(arr[middle]==search) { System.out.println("\nThe element is available at Index No." +middle); break; } else { last = middle-1; } middle = (first+last)/2; } if(first>last) { System.out.println("\nThe element is not available in given array"); } } }
The snapshot given below shows the sample run of above Java program on binary search, with user input 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 as ten elements and 7 as element to search:
Binary Search in Java - Complete Version
Since previous program has some limitations like when user enters elements in random order, then the program produces incorrect output. Also, the program allows user to enter only 10 elements. Therefore I've modified that program, to remove these limitations. Here is the modified version of previous program.
import java.util.Scanner; public class fresherearth { public static void main(String[] args) { int tot, i, search, first, last, middle, j, x; Scanner scan = new Scanner(System.in); System.out.print("Enter the Size: "); tot = scan.nextInt(); int[] arr = new int[tot]; System.out.print("Enter " +tot+" Elements: "); for(i=0; i<tot; i++) arr[i] = scan.nextInt(); // following block of code, sorts the array for(i=0; i<(tot-1); i++) { for(j=0; j<(tot-i-1); j++) { if(arr[j]>arr[j+1]) { x = arr[j]; arr[j] = arr[j+1]; arr[j+1] = x; } } } // following block of code, prints the sorted array System.out.println("\nNow the sorted array is:"); for(i=0; i<tot; i++) System.out.print(arr[i]+ " "); // things are done, now let's do binary search System.out.print("\n\nEnter an Element to Search: "); search = scan.nextInt(); first = 0; last = tot-1; middle = (first+last)/2; while(first<=last) { if(arr[middle]<search) first = middle+1; else if(arr[middle]==search) { System.out.println("\nThe element found at Index No." +middle+ ", Position No." +(middle+1)); break; } else last = middle-1; middle = (first+last)/2; } if(first>last) System.out.println("\nThe element is not available in given array"); } }
The sample run of above program with user inputs 6 as size, 100, 101, 102, 103, 104, 105 as its six elements, and 103 as element to search:
Binary Search in Java using for Loop
To create a program in Java that performs binary search, completely using for loop, then replace the following block of code, from above program:
first = 0; last = size-1; middle = (first+last)/2; while(first<=last) { if(arr[middle]<elem) first = middle+1; else if(arr[middle]==elem) { System.out.println("\nThe element found at Index No." +middle+ ", Position No." +(middle+1)); break; } else last = middle-1; middle = (first+last)/2; }
with the block of code, given below:
first = 0; last = size-1; for(middle=(first+last)/2; first<=last; middle=(first+last)/2) { if(arr[middle]<elem) first = middle+1; else if(arr[middle]==elem) { System.out.println("\nThe element found at Index No." +middle+ ", Position No." +(middle+1)); break; } else last = middle-1; }
Also, you can put the first two statements, inside the first statement of for loop, separate by comma. That is,
for(first=0, last=(size-1), middle=(first+last)/2; first<=last; middle=(first+last)/2)
Same Program in Other Languages
« Previous Program Next Program »