The thesis deals with the sorting problem, various ways of quicksort partitioning, and possible optimizations thereof. We carried out an experimental analysis comparing different algorithms based on the execution time, number of comparisons, number of moves and number of recursive calls with respect to the length of input data. The thesis also presents and implements a new model for generating test cases that covers existing test scenarios from previous analyses, as well as adds new ones. The sorting speed is an ever-changing problem influenced by hardware architecture, which is why it is important to have a repeatable and comparable way of testing algorithms on the same or larger test scenarios.
|
