Part one:

1. Identify at least five (5) algorithm differences that might be considered when choosing a sort algorithm.
2. Offer examples of related sorts with the discussion of each difference considered

Part Two:

You have formed a hypothesis that Big O analysis is not appropriate for comparing different sort algorithms, but rather for comparing the performance of a given sort algorithm as the number of sort keys change. (Hint: consider locality differences among sorts).