This program is designed to test the effectiveness of different sorting algorithms. In it, you can calculate how long it takes to sort an array, how many passes through the array, how many times two elements are compared, and how many permutations of elements occur. It is also possible to test if they are actually sorted and if they are sorted correctly by outputting these arrays before and after sorting. If you want, you can add your algorithms or even rewrite the library and test your programs there, before that, optimizing the graphical interface for your needs and making calls from the main window code.
This program was written for my scientific work, in which I determine the effectiveness of different sorting algorithms.
We launch the program and see three tabs. The first tab has two ComboBoxes and two buttons. In the first ComboBox we select the sorting method, in the second the size of the array. When you click on the first button, the time of sorting the array of the selected volume by the selected method will be calculated, and when you click on the second button, the number of passes, comparisons and permutations will be counted. On the second tab, you can check if the sorting methods are working and if they are working correctly. The same ComboBoxes and one button are present here. When you click on the button, an array is displayed before and after sorting. The third tab simply displays information about the program.
We just run the .pro file in our Qt environment and build the program. If necessary, you can rewrite it.
 Kalynovsky Valentin |
|