n creates a random list (A) of size 100, and makes a sorted version (B). a searches list A for the last element in the list via linear search. b searches list B for the same element via binary search. Check out how much faster binary search is! Click the cat for instructions.
