Реалізація паралельного алгоритму сортування 3-WAY Merge Sort

Abstract

The paper examines the development and performance evaluation of a parallel sorting algorithm for data arrays based on the three-way merge sorting technique (3-way Merge Sort). The features of sequential and parallel sorting methods are analyzed, an overview of known approaches to parallelizing recursive algorithms is provided, and the choice of software implementation tools is justified. A software module was developed in the C# programming language, the algorithmic structure of sorting was created and described, and a mechanism for adaptive switching between sequential and parallel execution based on a threshold value was implemented.