Binary Search : Sort Search « Collections Data Structure « Java

1. Java
2. Collections Data Structure
3. Sort Search

Binary Search

     
public class BinarySearchArray {
  private long[] a; 

  private int nElems; 

  public BinarySearchArray(int max) {
    a = new long[max]; // create array
    nElems = 0;
  }

  public int size() {
    return nElems;
  }

  public int find(long searchKey) {
    return recFind(searchKey, 0, nElems - 1);
  }

  private int recFind(long searchKey, int lowerBound, int upperBound) {
    int curIn;

    curIn = (lowerBound + upperBound) / 2;
    if (a[curIn] == searchKey)
      return curIn; // found it
    else if (lowerBound > upperBound)
      return nElems; // can't find it
    else // divide range
    {
      if (a[curIn] < searchKey) // in upper half
        return recFind(searchKey, curIn + 1, upperBound);
      else
        // in lower half
        return recFind(searchKey, lowerBound, curIn - 1);
    }
  }

  public void insert(long value) {
    int j;
    for (j = 0; j < nElems; j++)
      // find where it goes
      if (a[j] > value) // (linear search)
        break;
    for (int k = nElems; k > j; k--)
      // move bigger ones up
      a[k] = a[k - 1];
    a[j] = value; // insert it
    nElems++; // increment size
  }

  public void display() {
    for (int j = 0; j < nElems; j++)
      System.out.print(a[j] + " "); 
    System.out.println("");
  }
  public static void main(String[] args) {
    int maxSize = 100; 
    BinarySearchArray arr = new BinarySearchArray(maxSize); 

    arr.insert(12); 
    arr.insert(20);
    arr.insert(35);
    arr.insert(426);
    arr.insert(54);
    arr.insert(69);
    arr.insert(744);
    arr.insert(87);
    arr.insert(895);
    arr.insert(89);
    arr.insert(8);
    arr.insert(208);
    arr.insert(4);
    arr.insert(617);
    arr.insert(83);
    arr.insert(96);

    arr.display(); // display array

    int searchKey = 27; // search for item
    if (arr.find(searchKey) != arr.size())
      System.out.println("Found " + searchKey);
    else
      System.out.println("Can't find " + searchKey);
  }
}



           
         
    
    
    
    
  

Related examples in the same category

1.	Linear search
2.	Animation for quick sort
3.	Quick Sort Implementation with median-of-three partitioning and cutoff for small arrays
4.	Simple Sort Demo
5.	A simple applet class to demonstrate a sort algorithm
6.	Sorting an array of Strings
7.	Simple version of quick sort
8.	Combine Quick Sort Insertion Sort
9.	Quick sort with median-of-three partitioning
10.	Fast Quick Sort
11.	Selection sort
12.	Insert Sort for objects
13.	Insert sort
14.	Bubble sort
15.	Merge sort
16.	Fast Merge Sort
17.	Shell sort
18.	Recursive Binary Search Implementation in Java
19.	Topological sorting
20.	Heap sort
21.	Sort Numbers
22.	A quick sort demonstration algorithm
23.	Performing Binary Search on Java byte Array Example
24.	Performing Binary Search on Java char Array Example
25.	Performing Binary Search on Java double Array Example
26.	Performing Binary Search on Java float Array Example
27.	Performing Binary Search on Java int Array Example
28.	Performing Binary Search on Java long Array Example
29.	Performing Binary Search on Java short Array
30.	Sort items of an array
31.	Sort an array of objects
32.	Sort a String array
33.	Sort string array with Collator
34.	Binary search routines
35.	FastQ Sorts the [l,r] partition (inclusive) of the specfied array of Rows, using the comparator.
36.	A binary search implementation.
37.	Handles QuickSort and all of its methods.
38.	Implements QuickSort three different ways
39.	A quick sort algorithm to sort Vectors or arrays. Provides sort and binary search capabilities.
40.	Returns an array of indices indicating the order the data should be sorted in.