Part 1: Your tasks for this assignment are the following: Identify at least five (5) algorithm differences that might be considered when choosing a sort algorithm. Offer examples of related sorts with the discussion of each difference considered.
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: 5 fully documented differences among sorting algorithms. Support the differences with Sort algorithms that exemplify the related characteristics. Generate a summary of Sort differences. Include the Big O critique.
APA with References and citations, Attachment gives history of project to date