GitHub

This program implements multithreaded merge sort using pthreads. The goal is to efficiently sort an array of integers.

The program uses the divide-and-conquer strategy of merge sort, and it employs pthreads to parallelize the sorting process. The array is split into two halves, and each half is sorted in parallel.
GitHub

Merge-and-Shell-Sort-Benchmark

This is a Benchmark program I developed in Java for my CMSC 451 class that compares the perormance bwtween the Merge sort and Shell Sort algorithms. It specifically compares the average and ...