算法四 二分查找 java，c，c++

java代码：

package chapter1;

import java.io.DataInputStream;
import java.io.DataOutputStream;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.OutputStreamWriter;
import java.io.PrintStream;
import java.io.Writer;
import java.util.Arrays;

import javax.print.attribute.standard.PrinterState;

import edu.princeton.cs.algs4.In;
import edu.princeton.cs.algs4.StdIn;
import edu.princeton.cs.algs4.StdOut;

public class BinarySearch {
	public static int rank(int key, int[] a){
		int ret = -1;
		int lo = 0;
		int hi = a.length - 1;
		while(lo <= hi){
			int mid = lo + (hi - lo)/2;
			if(key < a[mid])
				hi = mid - 1;
			else if(key > a[mid])
				lo = mid + 1;
			else {
				ret = mid;
				break;
			}
		}
		return ret;
	}
	public static void main(String[] args){
		int[] whitelist = {1,2,3,4,5,6,7,8,9,10,11,12,131,456,1432};
		int[] whitelist2 = {1,2,3,4,5,6,7,8,11,23,545,654};
		Arrays.sort(whitelist);
		int key = 0;
		int i = 0;
		while(i < whitelist2.length){
			key = whitelist2[i];
			if(rank(key,whitelist)<0)
				System.out.print(key+" ");
			++i;
		}
		System.out.println();
		
		Arrays.sort(whitelist);
		
		
	}
}

C++代码：

#include "stdafx.h"
#include<iostream>
using namespace std;
int rank1(int key, int a[],int length){
	int lo = 0;
	int hi = length - 1;
	int ret = -1;
	while (lo <= hi) {
		int mid = lo + (hi - lo) / 2;
		if (key < a[mid])
			hi = mid - 1;
		else if (key > a[mid])
			lo = mid + 1;
		else {
			ret = mid;
			break;
		}
	}
	return ret;
}

int main()
{
	int whitelist[] = { 1,2,3,4,5,6,7,8,9,10,11,12,131,456,1432 };
	int whitelist2[] = { 1,2,3,4,5,6,7,8,11,23,545,654 };
	int i = 0;
	int key = 0;
	int whitelist2_length = sizeof(whitelist2) / sizeof(whitelist2[0]);
	while (i < whitelist2_length) {
		key = whitelist2[i];
		++i;
		if (rank1(key, whitelist, sizeof(whitelist) / sizeof(whitelist[0])) < 0) {
			cout << key << " ";
		}
	}
	cout << endl;
    return 0;
}