This program helps to compare of theoretical asymptotics of sorting algorithms with measurement results. You can plot graph for time dependence on array size. Also, remarkably, you can modify Run.java for testing others algorithms.
| Name | Best | Average | Worst | Memory | Stable |
|---|---|---|---|---|---|
| Quicksort | O(nlogn) | O(nlogn) | O(n2) | O(logn) | No |
| Insertion sort | O(n) | O(n2) | O(n2) | O(1) | Yes |
| Selection sort | O(n2) | O(n2) | O(n2) | O(1) | No |
| Bubble sort | O(n) | O(n2) | O(n2) | O(1) | Yes |
| Heapsort | O(nlogn) | O(nlogn) | O(nlogn) | O(1) | No |
- Swing (graphical interface)
- XChart (plotting)
- Maven
To build graphs with correct scale lower size input data for slow algorithms and enlarge for fast algorithms.