edu.princeton.cs.algorithms

Class BinarySearch

java.lang.Object

edu.princeton.cs.algorithms.BinarySearch

public class BinarySearch
extends Object

The BinarySearch class provides a static method for binary searching for an integer in a sorted array of integers.

The rank operations takes logarithmic time in the worst case.

For additional documentation, see Section 1.1 of Algorithms, 4th Edition by Robert Sedgewick and Kevin Wayne.

Author:

Robert Sedgewick, Kevin Wayne

Method Summary

Methods

Modifier and Type	Method and Description
static void	main(String[] args) Reads in a sequence of integers from the whitelist file, specified as a command-line argument.
static int	rank(int key, int[] a) Searches for the integer key in the sorted array a[].

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Method Detail

rank

public static int rank(int key,
       int[] a)

Searches for the integer key in the sorted array a[].

Parameters:

key - the search key

a - the array of integers, must be sorted in ascending order

Returns:

index of key in array a[] if present; -1 if not present

main

public static void main(String[] args)

Reads in a sequence of integers from the whitelist file, specified as a command-line argument. Reads in integers from standard input and prints to standard output those integers that do *not* appear in the file.