GROUP WORK
==========

Come up with the best, worst, and average Big-Oh performance for the following algorithms:

    Algorithm           Best            Worst           Average
---------------------------------------------------------------------
Selection Sort      |   O(N^2)      |   O(N^2)      |   O(N^2)      |
Insertion Sort      |   O(N)        |   O(N^2)      |   O(N^2)      |
Mergesort           |   O(N log N)  |   O(N log N)  |   O(N log N)  |
Quicksort           |   O(N log N)  |   O(N^2)      |   O(N log N)  |
Heapsort            |   O(N log N)? |   O(N log N)  |   O(N log N)  |
Binary Search       |   O(1)        |   O(log N)    |   O(log N)    | requires: sorted input
Sequential Search   |   O(1)        |   O(N)        |   O(N)        |
Selection           |   O(1)        |   O(N^2)      |   O(N)        |
---------------------------------------------------------------------