Java console application that solves a sorting problem which is defined as a total number of item to be sorted.
| Branch | Pipeline | Code coverage | Test report | SonarCloud |
|---|---|---|---|---|
| master |  |
 |
link | link |
- Code coverage badge on Gitlab using Maven and JaCoCo plugin | Java | JVM (YouTube video)
- All algorithms' details and the benchmark explanation
- Sorting algorithms exercises found on the Internet
- Maven
- Java 11 (AWS Corretto)
- Lombok
- JUnit 5
- Mockito
- LogCaptor
- Enable annotation processing in your IDE (required by Lombok)
- Import this repository as Maven project.
- Run application using a main class:
SortingAlgorithmsAppLauncher
An algorithm is a set of instructions designed to perform a specific task. Sometimes an algorithm might produce a different output when given the same input. This relates to the area of deterministic and non-deterministic algorithms. Sorting algorithms are deterministic.
Benchmarking is the process of evaluating the performance of algorithms by measuring their execution time, memory usage, or other relevant metrics. It involves running algorithms on standardized datasets or tasks to obtain quantitative measurements that can be used for comparison. The goal of benchmarking is to provide an objective assessment of algorithm performance and identify potential areas for improvement.
Benchmarking allows us to compare the performance of different algorithms on specific tasks or datasets, enabling us to make informed decisions about which algorithm to use in a given context.
Ref: https://saturncloud.io/blog/is-the-benchmarking-of-my-algorithms-right/
| Algorithm | 50000 elements (ns) | 100000 elements (ns) | 150000 elements (ns) | Best complexity | Average complexity | Worst complexity | Space complexity (the worst) | Stable | In place |
|---|---|---|---|---|---|---|---|---|---|
| Bubble sort | 4928230700 | 20074524300 | 37438477400 | O(n) | O(n^2) | O(n^2) | O(1) | yes | yes |
| Cocktail Shaker sort (Bidirectional bubble sort) |
1622600 | 1603300 | 1278200 | O(n) | O(n^2) | O(n^2) | O(1) | yes | yes |
| Selection sort | 469744400 | 1834796800 | 4116949900 | O(n^2) | O(n^2) | O(n^2) | O(1) | no | yes |
| Insertion sort | 1595300 | 1352000 | 208500 | O(n) | O(n^2) | O(n^2) | O(1) | yes | yes |
| Shell sort | 6446800 | 2566500 | 1116300 | O(n log n) | depends on gap sequence | O(n^2) | O(1) | no | yes |
| Counting sort | 16629700 | 6919800 | 7940500 | O(n+k) | O(n+k) | O(n+k) | O(n+k) | yes/no* | no/yes* |
| Heap sort | 11219900 | 33287900 | 16133000 | O(n log n) | O(n log n) | O(n log n) | O(1) | no | yes |
| Merge sort | 11539000 | 8662800 | 18594200 | O(n log n) | O(n log n) | O(n log n) | O(n) | yes | no |
| Quick sort | 4743300 | 2344100 | 3392600 | O(n log n) | O(n log n) | O(n^2) | O(log n) | no | yes |
ns - nanoseconds, B - bytes, n - number of elements in an array, k - the dataset/array elements range
The table is auto generated using the app. Choose 10 to generate new results and copy the table from resources.
Remarks
*The counting sort can be implemented as:
- not in-place: stable, O(N) space complexity,
- in-place: none stable, O(1) space complexity.
Table generated using: https://www.tablesgenerator.com/markdown_tables#
Big O Notation reference: https://www.bigocheatsheet.com/
Run Maven commands using Maven Release plugin.
mvn release:prepare