Assignment: Sorting Algorithms
Part 1
Identify at least five 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).
The response should include a reference list. Double-space, using Times New Roman 12 pnt font, one-inch margins, and APA style of writing and citations.