Binary search program in java

Binary search works on sorted arrays.
A binary search begins by comparing the middle element of the array with the target value.
If the target value matches the middle element, its position in the array is returned.
If the target value is less or more than the middle element, the search continues the lower or
upper half of the array respectively with a new middle element, eliminating the other half from consideration.

Binary search is a fast search algorithm with run-time complexity of Ο(log n).
This search algorithm works on the principle of divide and conquer.
For this algorithm to work properly the data collection should be in sorted form.

package com.rohan.test;

import java.util.Arrays;
import java.util.Scanner;

public class BinarySearch {
 /**
  * 
  * @param This
  *            is complete program
  */
 public static void main(String[] args) {
  int[] a = { 10, 5, 44, 42, 7, 11, 81 };

   System.out.println("Enter the element to be searched");
  Scanner sc = new Scanner(System.in);
  int itemToBeSearched = Integer.parseInt(sc.next());
  Arrays.sort(a);// binary sort requires elements to be sorted.
  for (int i = 0; i < a.length; i++)
   System.out.print(a[i] + " ");

   int start = 1, end = a.length - 1;
  int middle = (start + end) / 2;

   while (itemToBeSearched != a[middle] && start <= end) {
   if (itemToBeSearched > a[middle])
    start = middle + 1;
   else
    end = middle - 1;
   middle = (start + end) / 2;
  }
  if (itemToBeSearched == a[middle])
   System.out.println("\n" + itemToBeSearched + " is found");
  if (start > end)
   System.out.println("\n" + itemToBeSearched
     + " is not found in the array");
 }
}