This repo contains an unoptimized sequential and an optimized parallel implemention of mergesort in Go. Not for production use.
There are some posts that complement this repo:
- Sequential and parallel mergesort in Go. Describes the initial (baseline) implementations.
- Optimizing parallel Merge Sort with Go tools. Describes the journey of optimising the parallel implementation using the
pprofandtracetools.
The optimization steps are also distinct branches. master contains the most optimized implementation.