OpenMP/C project implementing Multisort, a parallel divide-and-conquer sorting algorithm. Recursively splits arrays into four parts, sorts in parallel with tasks, merges results, and uses sequential Quicksort for small sub-arrays. Optimized for high-performance multi-threaded execution (Parallel Systems, UNIWA).