Реалізація паралельного алгоритму сортування Cocktail Sort за допомогою OpenMP

Abstract

The paper considers the development of a parallel Cocktail Sort algorithm using multithreaded computing. The features of bidirectional array sorting and existing approaches to improving the performance of sorting algorithms through parallelization are analyzed. The choice of the C++ programming language and the OpenMP technology for implementing the software module, as well as the development environment, is substantiated. A software implementation of both sequential and parallel versions of the Cocktail Sort algorithm is developed, and experimental performance testing is conducted for different array sizes and input data types. The obtained results confirm the effectiveness of parallel computing in reducing sorting time and can be applied to the processing of large data arrays.