Scribd Logo
Upload

Welcome to Scribd!

  • B.T Search

    Uploaded by

    Tony-99
    6 views6 pages
    The document contains code for implementing binary search on an array. It defines a BinarySearch class with a search method that takes an array and element to search for. The method recursively searches halves of the array to find the index of the element. The main method initializes an array, gets user input for an element, calls the search method and prints whether the element was found and its index.

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document contains code for implementing binary search on an array. It defines a BinarySearch class with a search method that takes an array and element to search for. The method recursively searches halves of the array to find the index of the element. The main method initializes an array, gets user input for an element, calls the search method and prints whether the element was found and its index.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    6 views6 pages

    B.T Search

    Uploaded by

    Tony-99
    The document contains code for implementing binary search on an array. It defines a BinarySearch class with a search method that takes an array and element to search for. The method recursively searches halves of the array to find the index of the element. The main method initializes an array, gets user input for an element, calls the search method and prints whether the element was found and its index.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 6

    package tree;

    import tree.Binarytree;

    public class BTMain {

    public static void main(String[] args)

    Binarytree obj= new Binarytree();

    obj.addnode();

    obj.inoreder();

    obj.preorder();

    obj.postorder();

    package tree;

    import java.util.Scanner;

    class Binarysearch

    public int search(int arr[],int start,int end,int element)

    if(start==end)

    if(arr[start]==element)
    {

    return start;

    else

    return -1;

    int mid= (start+end)/2;

    if(element == arr[mid])

    return mid;

    if(element > arr[mid])

    return search( arr,(mid+1), end, element);

    else

    return search(arr,0, (mid-1),element);

    public class SequentialMain {

    public static void main(String[] args)

    int arr[]= {15,32,24,67,49,10};

    Scanner sc= new Scanner (System.in);

    System.out.println("Enter element for serach");

    int num= sc.nextInt();

    int position= search(num, arr);

    if(position >=0)

    System.out.println("position="+(position+1));

    }
    else

    System.out.println("index not found");

    private static int search(int element , int arr[])

    for(int i=0; i<arr.length; i++)

    if(arr[i] == element)

    return i;

    return -1;

    package tree;

    import java.util.Scanner;

    class Binarysearch

    public int search(int arr[],int start,int end,int element)

    if(start==end)

    if(arr[start]==element)
    {

    return start;

    else

    return -1;

    int mid= (start+end)/2;

    if(element == arr[mid])

    return mid;

    if(element > arr[mid])

    return search( arr,(mid+1), end, element);

    else

    return search(arr,0, (mid-1),element);

    public class BinarsearchMain {

    public static void main(String[] args)

    Binarysearch obj= new Binarysearch();

    int arr[]= { 15 , 32 , 24, 67 ,49,10};

    int end,element;

    end= arr.length-1;

    Scanner sc= new Scanner (System.in);

    System.out.println("enter element to search=");

    int num= sc.nextInt()

    int x= obj.search(arr, 0, end, num);


    System.out.println("index="+x);

    if(x>=0)

    System.out.println("element at position="+(x+1));

    else

    System.out.println("element not found");

    You might also like