This project implements the Parallel Merge Sort algorithm in c++. Parallel Merge Sort is an optimized version of the traditional Merge Sort algorithm that utilizes multiple threads to perform sorting operations concurrently, improving performance on multi-core systems.
- Efficient parallel sorting using multiple threads
- Customizable thread pool size
- Handles large datasets efficiently
- Easy-to-use API
- c++ compiler/interpreter
- Clone the repository:
git clone https://github.com/premchand11/parallelMergeSort.git- Navigate to the project directory:
cd parallelMergeSort- Compile the source code
- Run the program
Contributions are welcome! Please fork the repository and submit a pull request.
For any questions or suggestions, please open an issue or contact [email protected]
