Comparison based Sort

Reading

• Selection sort.
• Insertion sort.
• Heapsort.
• Shellsort.

Exercise

• Source codes.
• Unit tests.

Quiz

• Create classes ShellSortPratt and ShellSortHibbard under sort.comparison extending ShellSort.
• ShellSortPratt and ShellSortHibbard must use the Pratt and Hibbard sequences, respectively. Feel free to use the code in ShellSortKnuth:
• Pratt: successive numbers of the form 2^p3^q (1, 2, 3, 4, 6, 8, 9, 12, ...)
• Hibbard: 2^k - 1 (1, 3, 7, 15, 31, 63, ...)
• Run the unit test and make sure your sorting algorithms perform accurately.
• Compare the speed between ShellSortPratt, ShellSortHibbard, and ShellSortKnuth using the unit test. Write a report about the speed comparison and save it as quiz2.pdf.
• Submit ShellSortPratt.java, ShellSortHibbard.java, and quiz2.pdf: https://canvas.emory.edu/courses/32845/assignments/75152