In this lab session, you do an empirical test of performance comparison of various sorting algorithms.
You should be able to do Part I and II during the lab. At the end of
the lab (or before 11:59 pm 11/6 Fri), submit "MyBubble.java", which is
Part III is optional. If you have finished before the time, try Part III and have fun.
It is showing the performance of four different sorting algorithms (Insertion, Selection, Bubble, and the one used in the Java Array library (which is called "Dual-Pivot Quicksort")). The values are the execution time (in nanosecond, and averaged over 5 runs).
"Implementation note: The sorting algorithm is a Dual-Pivot Quicksort by Vladimir Yaroslavskiy, Jon Bentley, and Joshua Bloch. This algorithm offers O(n log(n)) performance on many data sets that cause other quicksorts to degrade to quadratic performance, and is typically faster than traditional (one-pivot) Quicksort implementations. "
Do a search on the internet to find their exact algorithm, and present it (in the form of a document for me to read).
Submit "MyBubble.java" on COL, Lab3 bin, before 11:59 pm 11/8 Fri.