A group assignment at the Lyceum BSU on sorting arrays using different sorting algorithms.
This project is a project that groups of students at the Lyceum BSU had to complete after learning the theory behind sorting algorithms. It was necessary to compare different sorting algorithms.
- Generation of source data
- Slow sorting algorithms (
selection
,insertion
,swap
/bubble
) - Fast sorting algorithms (
merge
,qsort
, comparison withstd::sort
) - Scripts for testing and data collection