import java.util.*;

public class BubbleSort
{
	static void bubbleSort(int arr[])
	{
		int n = arr.length;
		for (int i = 0; i < n-1; i++)
			for (int j = 0; j < n-i-1; j++)
				if (arr[j] > arr[j+1])
				{
					int temp = arr[j];
					arr[j] = arr[j+1];
					arr[j+1] = temp;
				}
	}
	static void printArray(int arr[])
	{
		int n = arr.length;
		for (int **0; i<n; ++i)
			System.out.print(arr[i] + " ");
		System.out.println();
	}
	public static void main(String args[])
	{
	    Scanner sc = new Scanner(System.in);
		BubbleSort ob = new BubbleSort();
		System.out.println("Enter No. Of Elements To Sort : ");
		int n=sc.nextInt();
		int arr[] = new int [n];
		System.out.println("Enter Elements : ");
		for(int **0;i<n;i++)
		    arr[i] = sc.nextInt();
		bubbleSort(arr);
		System.out.println("Sorted array");
		printArray(arr);
	}
}



						22222222222222222

import java.util.*;

public class Search_Element
{
    public static void main(String[] args) 
    {
        int n, x, flag = 0, i = 0;
        Scanner s = new Scanner(System.in);
        System.out.print("Enter no. of elements you want in array:");
        n = s.nextInt();
        int a[] = new int[n];
        System.out.println("Enter all the elements:");
        for(i = 0; i < n; i++)
        {
            a[i] = s.nextInt();
        }
        System.out.print("Enter the element you want to find:");
        x = s.nextInt();
        for(i = 0; i < n; i++)
        {
            if(a[i] == x)
            {
                flag = 1;
                break;
            }
            else
            {
                flag = 0;
            }
        }
        if(flag == 1)
        {
            System.out.println("True");
        }
        else
        {
            System.out.println("False");
        }
    }
}

								3333333333333

import java.util.*;
 
public class InsertionSort 
{
    public static void sort( int arr[] )
    {
        int N = arr.length;
        int i, j, temp;
        for (i = 1; i< N; i++) 
        {
            j = i;
            temp = arr[i];    
            while (j > 0 && temp < arr[j-1])
            {
                arr[j] = arr[j-1];
                j = j-1;
            }
            arr[j] = temp;            
        }        
    }    
    public static void main(String[] args) 
    {
        Scanner sc = new Scanner( System.in );        
        int n, i;
        System.out.println("Enter number of integer elements");
        n = sc.nextInt();
        int arr[] = new int[ n ];
        System.out.println("\nEnter "+ n +" integer elements");
        for (i = 0; i < n; i++)
            arr[i] = sc.nextInt();
        sort(arr);
        System.out.println("\nElements after sorting ");        
        for (i = 0; i < n; i++)
            System.out.print(arr[i]+" ");            
        System.out.println();                     
    }    
}
                          4444444444444
                          
import java.util.*;

public class BinarySearchMenu
{
    public static boolean findElement(int arr[], int key) 
    {
        int l = 0;
        int r = arr.length - 1;
    
        while (r >= l)
        {
          int mid = (l + r) / 2;
          if (key < arr[mid])
            r = mid - 1;
          else if (key == arr[mid])
            return true;
          else
            l = mid + 1;
        }
        return false;
    }
    public static boolean findString(String[] names, String name)
	{
		int l = 0, r = names.length - 1;
		while (l <= r) {
			int m = l + (r - l) / 2;
			int res = name.compareTo(names[m]);
			if (res == 0)
				return true;
			if (res > 0)
				l = m + 1;
			else
				r = m - 1;
		}
		return false;
	}
    public static void main(String args[])
    {
        
        Scanner sc = new Scanner(System.in);
        
        System.out.println("1. Binary search for Integer elements");
        System.out.println("2. Binary search for Strings");
        System.out.println("3. Exit");
        System.out.println("Enter your choice : ");
        int choice = sc.nextInt();
        
        switch(choice)
        {
            case 1:
                System.out.print("Enter no. of elements you want in array: ");
                int n = sc.nextInt();
                int arr[] = new int[n];
                System.out.println("Enter all the elements: ");
                for(int i = 0; i < n; i++)
                {
                    arr[i] = sc.nextInt();
                }
                System.out.print("Enter the element you want to find: ");
                int key = sc.nextInt();
                boolean result = findElement(arr, key);
                if(result == true)
                    System.out.print("True");
                else
                    System.out.print("False");
                break;
                
            case 2:
                System.out.print("Enter no. of names you want to store: ");
                n = sc.nextInt();
                String[] names = new String[n];
        		System.out.println("Enter all the names : ");
        		for(int **0; i<n; i++)  
                {  
                   names[i]=sc.nextLine();  
                }
                System.out.println("Enter name to search : ");
        		String name = sc.nextLine();
        		boolean result1 = findString(names, name);
        
        		if (result1 == true)
        			System.out.println("True");
        		else
        			System.out.println("False");
                break;
                
            case 3:
                break;
                
            default:
                System.out.println("Wrong choice!");
        }
    }
}