Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 31 views

    AIM: Program To Implement Binary Search Program

    Uploaded by

    niharika sunkara
    This program implements a binary search algorithm to search for a value in an ArrayList. It takes in two ArrayLists, a start and end index, compares the middle element of the first list to the first element of the second list, and recursively searches either the lower or upper half depending on if the element is smaller or larger than the target. It returns the index of the element if found, or -1 if not found. The main method tests it by searching for the value 8 in a sample ArrayList.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd

    AIM: Program To Implement Binary Search Program

    Uploaded by

    niharika sunkara
    31 views2 pages
    This program implements a binary search algorithm to search for a value in an ArrayList. It takes in two ArrayLists, a start and end index, compares the middle element of the first list to the first element of the second list, and recursively searches either the lower or upper half depending on if the element is smaller or larger than the target. It returns the index of the element if found, or -1 if not found. The main method tests it by searching for the value 8 in a sample ArrayList.

    Original Description:

    Binary Searching

    Original Title

    Binary Search

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This program implements a binary search algorithm to search for a value in an ArrayList. It takes in two ArrayLists, a start and end index, compares the middle element of the first list to the first element of the second list, and recursively searches either the lower or upper half depending on if the element is smaller or larger than the target. It returns the index of the element if found, or -1 if not found. The main method tests it by searching for the value 8 in a sample ArrayList.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    31 views2 pages

    AIM: Program To Implement Binary Search Program

    Uploaded by

    niharika sunkara
    This program implements a binary search algorithm to search for a value in an ArrayList. It takes in two ArrayLists, a start and end index, compares the middle element of the first list to the first element of the second list, and recursively searches either the lower or upper half depending on if the element is smaller or larger than the target. It returns the index of the element if found, or -1 if not found. The main method tests it by searching for the value 8 in a sample ArrayList.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    of 2

    AIM: Program to implement Binary Search

    Program:
    import java.lang.reflect.Array;
    import java.util.ArrayList;

    public class BinarySearch {

    public static <T extends Comparable<T>> int binarySearch(ArrayList<T> a, ArrayList<T>


    b, int lo, int hi) {
    if (lo < hi) {
    int mid = (lo / 2) + (hi / 2);
    int cmp = (a.get(mid)).compareTo(b.get(0));
    if (cmp > 0) return binarySearch(a, b, lo, mid - 1);
    if (cmp < 0) return binarySearch(a, b, mid + 1, hi);
    return mid;
    }
    return -1;
    }
    public static void main(String[] args) {
    ArrayList<Integer> a = new ArrayList<Integer>();
    int value=6;
    ArrayList<Integer> b = new ArrayList<Integer>();
    a.add(1);
    a.add(2);
    a.add(3);
    a.add(4);
    a.add(6);
    a.add(8);
    a.add(9);
    b.add(8);
    value=BinarySearch.binarySearch(a,b,0,a.size()-1);
    System.out.println("value is at:"+value);
    }
    }
    OUTPUT:

    You might also like