problem 5.7

gistfile1.java

public static int findMissing( int[] a ) {
  Arrays.sort( a );
	if ( fetch( 0, 0 ) != 0 ) 
		return 0;
	int max = ( int ) Math.log( n ) / Math.log( 2 );
	for ( int i = 1; i < n; i++ ) {
		j = ( int ) Math.log( n ) / Math.log( i );
		if ( fetch( j, i ) != 1 )
			return i;
	}
}
//int fetch( int j, int i )