The below applet demonstrates why a binary search is a much more efficient searching method on a sorted list than sequential search. Type in the
first few letters of the words, and both the columns should shrink the number of words shown to only those words that have the same prefix.
The column on the left uses sequential search to find matches, while the right column uses binary search. Through proper use of threading, you
can see the updates in real time and can interrupt a search at any time. To make the time differential noticeable, there is a one millisecond
(1/1000th of a second) pause between each step in both algorithms.