java binary sort

import java.util.*;
class binarysearch
{
public static void main(String[] args)
  {
    
   
   int arr[],n,key,mid,low=0,high,i,temp;
    Scanner sc = new Scanner(System.in);
    System.out.println("Enter the number of elements in the array:");
    n= sc.nextInt();
    high=n-1;
    arr=new int[n];
    System.out.println("Enter "+n+" elements:");
    for(i=0;i<n;i++)
    {
        arr[i]=sc.nextInt();
    }
    for(i=0;i<n;i++)
    {
        for(int j=i;j<n;j++)
        {
            if(arr[i]>arr[j])
            {
             temp=arr[i];
             arr[i]=arr[j];
             arr[j]=temp;
            }
        }
    }
    System.out.println("The array after sorting");
    for (i=0;i<n;i++)
    {
      System.out.println(arr[i]+",");
    }
   System.out.println("\n This program is for binary search");
   System.out.println("\n Enter a key value to search in the array:");
    key= sc.nextInt();
    for(i=0;i<5;i++)
     {
         mid=(high+low)/2;
         
         if(key==arr[mid])
         {
             System.out.println("The "+key+" Found at "+(mid+1)+" th position of array");
             break;
         }
         else if(key<arr[mid])
         {
             high=mid;
         }
         else if (key>arr[mid])
         {
             low=mid;
         }
     }   
}
}