\fHI've created a file which contains names of all students
in CSC104/108/148.  In UNIX, I can use "wc" for word count
which tells me that it contains...

wc names
     \fC745    2771   23095 names

\fH... 745 names.

Next I constructed a script to exercise the driver that contains
"names" followed by a set of queries.  There are exactly 745*3
queries.  Exactly 745 of them will fail.

Let's time the results for the different searches.

\f(HDLINEAR Search\fP:
.sp 0.075i
time turingx driversearch2.t <script.search 

\fCEnter a file name containing the list:
OK.  Taking data from names
16.010u 0.040s 0:16.15 99.3% 0+399k 1+0io 0pf+0w
 
\f(HDBINARY Search 1\fP:
.sp 0.075i 
\fHtime turingx driversearch2.t < script.search
\fCEnter a file name containing the list:
OK.  Taking data from names
\fC0.850u 0.050s 0:00.90 100.0% 0+386k 0+0io 0pf+0w

\f(HDBINARY Search 2\fP:
.sp 0.075i
\fCEnter a file name containing the list:
OK.  Taking data from names
\fC0.850u 0.050s 0:00.90 100.0% 0+386k 0+0io 0pf+0w

\fHhoc
16.010/0.850
	\fC18.835294

\f(HDSo, binary search is about 19 times faster in this case.\fP
\f(HDBut how do we get a list in sorted order? ... slowly\fP