Name		Name	Last commit message	Last commit date
README.md		README.md

Repository files navigation

MPI-OpenMP-Sorting-Complexity-Study

About

A comprehensive performance analysis of N log N sorting algorithms (Heap, Tim, Intro, Merge, Quick) implemented with hybrid MPI and OpenMP. Explores algorithm complexity, multi-threading (1-16 threads), multi-core (1-4 cores), and scalability on large datasets, with detailed performance graphs.

algorithm-efficiency benchmarking c data-structures distributed-computing high-performance-computing mpi multithreading openmp parallel-computing performance-analysis performance-testing sorting-algorithms

0 stars

0 watching

Report repository

Releases

Packages

Contributors