Optimizing the Performance of STD::LIST through Choosing the Most Efficient Memory Allocation Strategy

Abstract

Explored the QuickSort sorting algorithm, which is one of the most efficient sorting methods. The focus of the research is on the statistical comparison of the algorithm’s performance in different scenarios of choosing a pivot element. The worst-case, average-case, and best-case scenarios are considered, as well as the use of randomized and deterministic approaches in selecting the pivot element. A practical experiment was conducted, comparing implementations of the algorithm using randomized and deterministic pivot selection algorithms.