binarysearch.java

package com.capability3;
import java.util.*;
public class binarysearch
{
	public static boolean search(int []arr,int n,int key)
	{
		// Insert sort
		int temp;
		for(int i=0;i<n;i++)
		{
			for(int j=0;j<n-i-1;j++)
			{
				if(arr[i]>arr[j+1])
				{
					temp=arr[j+1];
					arr[j+1]=arr[i];
					arr[i]=temp;
				}
			}
		}
		// Binary search
		int first=0;
		int last=n-1;
		int mid=(first+last)/2;
		while(first<=last)
		{
			if(arr[mid]<key)
			{
				first=mid+1;
			}
			else if(arr[mid]==key)
			{
				return true;
			}
			else
			{
				last=mid-1;
			}
			mid=(first+last)/2;
		}
		return false;
	}
	public static void main(String args[])
	{
		Scanner in=new Scanner(System.in);
        // Input array
		System.out.println("Enter the size of array");
		int n = in.nextInt();
		int []arr = new int[n];
		for(int i=0;i<n;i++)
		{
			System.out.println("Enter the array elements");
			arr[i]=in.nextInt();
		}
        // Search element
		System.out.println("Enter number to be searched");
		int key = in.nextInt();
		System.out.println(search(arr,n,key));
	}
}

bubblesort.java

package com.capability3;
import java.util.*;
public class bubblesort
{
	public static int[] sort(int[]arr,int n)
	{
		
		int temp = 0;  
        for(int i=0; i < n; i++){  
           for(int j=1; j < (n-i); j++){  
             if(arr[j-1] > arr[j]){   
              temp = arr[j-1];  
              arr[j-1] = arr[j];  
              arr[j] = temp;  
	}
}}return arr;
        }
	public static void main(String args[])
	{
	Scanner in=new Scanner(System.in);
	System.out.println("enter size of array");
	int n=in.nextInt();
	int[] arr=new int[n];
	for(int i=0;i<n;i++)
	{
	System.out.println("Enter arrray elements");;
	arr[i]=in.nextInt();
	}
	sort(arr,n);
	for(int i=0;i<n;i++)
	{
		System.out.println(arr[i]);
	}}
}

sirmenudriven.java

package com.capability3;
import java.util.*;
public class sirmenudriven {
    public static void main(String args[]) {
        Scanner in = new Scanner(System.in);
        int arr[][] = new int[3][3];
        System.out.println("Enter the numbers");
        for (int i = 0; i < 3; i++) {
            for (int j = 0; j < 3; j++) {
                arr[i][j] = in.nextInt();
            }
        }
        System.out.println("Enter 1 for binary search\n\t2 for left diagonal sort\n\t3 for sort second coulumn\n\t4 for linear search");
        int a = in.nextInt();
        switch(a) {
            case 1:
                System.out.println("Enter the number to be searched");
                int n = in.nextInt();
                int arr1[] = new int[arr.length * arr.length];
                int c = 0;
                for (int i = 0; i < arr.length; i++) {
                    for (int j = 0; j < arr[i].length; j++) {
                        arr1[c] = arr[i][j];
                        c++;
                    }
                }
                int arr2[] = insertionsort.sort(arr1, arr1.length);
                int first = 0;
                int last = arr2.length;
                boolean check = binarysearch.search(arr2, arr2.length, n);
                if (check) {
                    System.out.println("Found");
                } else {
                    System.out.println("Not Found");
                }
                break;
            case 2:
                int diag[] = new int[3];
                for (int i = 0; i < arr.length; i++)
                     diag[i] = arr[i][i];
                int diag2[] = insertionsort.sort(diag, diag.length);
                for (int i = 0; i < arr.length; i++)
                     arr[i][i] = diag2[i];
                System.out.println("After sorting");
                for (int k = 0; k < arr.length; k++)
                {
                    for (int l = 0; l < arr[k].length; l++)
                        System.out.print(String.format(" % 8d ",arr[k][l]));
                    System.out.println();
                }
                break;
            case 3:
                break;
        }
    }
}