we will use three different ways to solve the problem that given a list of ordered N integers, numbered from 0 to N-1, checking to see that N is not in this list.

The three ways are as follows:

1、　　Iterative Version

2、　　Recursive Version in birnary search

3、　　Binary Search

Then run the program and record the accurate time each way costs. And compare the differences of these algorithms.