CONSTRUCTION OF SORTING ALGORITHMS

Abstract

With the development of digital technologies and the increase in the volume of processed data, the efficiency of sorting algorithms is becoming critical. The paper considers the evolution of sorting algorithms from classical to hybrid methods, in particular Timsort and Introsort, which demonstrate improved time characteristics and stability compared to traditional approaches. Special attention is paid to data preprocessing methods and their impact on performance. A constructive-synthesizing modeling approach is proposed to create adaptive sorting algorithms, which allows combining existing methods and forming new effective algorithms. The use of a genetic algorithm in the design process allows automating the selection of optimal sorting strategies according to the characteristics of the input data. The results obtained confirm the prospects of using a constructive-synthesizing approach to build adaptive sorting algorithms that provide high performance in various conditions.