QuanHoangNgoc/Parallel-Merge-Sort-ADA-

Parallel Merge Sort is an optimized sorting algorithm that leverages parallel processing to enhance the performance of the traditional merge sort. This project implements a parallel version of the merge sort algorithm using Python, allowing for efficient sorting of large datasets.

Language: Jupyter Notebook - Size: 457 KB - Last synced at: 10 months ago - Pushed at: 10 months ago - Stars: 2 - Forks: 0