Part 1: Your tasks for this assignment are the following:
Part 2: Rationalize:
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).
Week 3 Deliverables:
APA with References and citations, Attachment gives history of project to date