An effortless Bubble Sort & Binary Search

import java.io.*;
class Binarysearch
{
    public static void main()throws IOException
    {
        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
        System.out.println("Enter the length of the array");
        int len=Integer.parseInt(br.readLine());
        int arr[]=new int[len];
        int l=0,u=len-1,mid,p=0,temp;
        for(int i=0;i<len;i++)
        {
            System.out.println("Enter the elements of the array");
            arr[i]=Integer.parseInt(br.readLine());
        }
        for(int i=0;i<len-1;i++)
        {
            for(int j=i+1;j<len;j++)
            {
                if(arr[i]>arr[j])
                {
                    temp=arr[j];
                    arr[j]=arr[i];
                    arr[i]=temp;
                }
            }
        }
        
        System.out.println("The sorted array is");
        for(int i=0;i<len;i++)
        {
            System.out.println(arr[i]);
        }
        System.out.println("Enter the element that needss to be searched");
        int num=Integer.parseInt(br.readLine());
        while(l<=u)
        {
            mid=(l+u)/2;
            if(arr[mid]==num)
            {
                p=mid;
                break;
            }
            else if(num>arr[mid])
                l=mid+1;
            else
                u=mid-1;
        }
        if(p!=0)
            System.out.println("The element is at index no: "+p);
        else 
            System.out.println("The element cannot be found");
    }
}