Assignment 3: Recursion and Big-O

Suppose you have N locations connected by sidewalks.
To find the shortest path from location A to location B ...
List all the paths from A to B
Find the distance of each path.
Take the smallest of all those values.

To find the smallest value in a collection ...
Set smallestSoFar to one value in the collection
While unchecked values remain in the collectoin
  Pick one
  If that value is smaller than guess then
    Set smallestSoFar to that value
Return smallestSoFar

To find the smallest value in a collection ...
If the collection has only one element
  Return that element
Otherwise
  Split the collection into two equal halves
  Find the smallest value in each half
  Return the smaller of those two values

To find the smallest difference between any two 
  different numbers in a collection ...
Set estimate to ``infinity''
For each value, v, in the collection
  For each value, u, not equal to v
    If |u-v| < estimate then
      Set estimate to |u-v|
Return estimate