%0 Journal Article
%T Accelerating Large-Scale Sorting through Parallel Algorithms
%A Yahya Alhabboub
%A Fares Almutairi
%A Mohammed Safhi
%A Yazan Alqahtani
%A Adam Almeedani
%A Yasir Alguwaifli
%J Journal of Computer and Communications
%P 131-138
%@ 2327-5227
%D 2024
%I Scientific Research Publishing
%R 10.4236/jcc.2024.121009
%X This study explores the application of parallel algorithms to enhance large-scale sorting, focusing on the QuickSort method. Implemented in both sequential and parallel forms, the paper provides a detailed comparison of their performance. This study investigates the efficacy of both techniques through the lens of array generation and pivot selection to manage datasets of varying sizes. This study meticulously documents the performance metrics, recording 16,499.2 milliseconds for the serial implementation and 16,339 milliseconds for the parallel implementation when sorting an array by using C++ chrono library. These results suggest that while the performance gains of the parallel approach over its serial counterpart are not immediately pronounced for smaller datasets, the benefits are expected to be more substantial as the dataset size increases.
%K Sorting Algorithm
%K Quick Sort
%K QuickSort Parallel
%K Parallel Algorithms
%U http://www.scirp.org/journal/PaperInformation.aspx?PaperID=130818