Binary search algorithm implementation in java

Binary search:

Binary search is a searching algorithm that can search first-er then Sequential search. It's executed in O (log N) time.

A binary search can

only be performed if the list is in sorted order.

Here is Java code of Binary search:

import java.util.Scanner; public class BinarySearchTry { public static void main(String[] args) { int n, key, b, j, mid, t; Scanner s = new Scanner(System.in); System.out.println("Enter number of element: "); n = s.nextInt(); int[] ar = new int[n]; for(j = 0; j<n ; j++){ System.out.println("No "+ (j+1) + " = "); ar[j] = s.nextInt(); } System.out.println("Enter element to search: "); key = s.nextInt(); b = 1; t = n; do{ mid = (b+t)/2; if(key<ar[mid]){ t = mid - 1; } else if(key>ar[mid]){ b = mid+1; } } while(key != ar[mid] && b<= t); if(key == ar[mid]){ System.out.println("Found !!!"); } else{ System.out.println("Not Found !!!"); } } }

Here is the C code for Binary search.
Comment if you need any help.

You may like:

Binary search in C                                                             Art of programming contest