About SortPedia
SortPedia is a modern, interactive encyclopedia of sorting algorithms. It bridges the gap between abstract computer science theory and intuitive visual understanding.
What We Offer
Interactive Visualizer
Don't just read code—watch it execute. Step through algorithms in real-time, track memory accesses, and visualize how data moves through the array.
Algorithm Racing
Compare algorithms side-by-side on identical datasets. Visually understand why vastly outperforms as input sizes grow.
Performance Benchmarking
Run actual performance tests in your browser. Our multi-threaded engine allows you to measure raw execution time across averaged runs without freezing the UI.
Comprehensive Library
A dedicated wiki for over 30 algorithms. Includes clean implementations, mathematical complexity analysis, stability info, and historical context.
Our Mission
Sorting algorithms are often the "Hello World" of algorithm analysis, introducing crucial concepts like Big-O notation, Divide and Conquer, and memory management.
However, static diagrams in textbooks often fail to convey the dynamic nature of how these algorithms manipulate memory. SortPedia aims to provide a "Single Source of Truth" for sorting knowledge, ensuring that students and enthusiasts have access to:
- Accurate, step-by-step visualizations.
- Real-time operation counting (comparisons, swaps).
- Clear, formatted mathematical explanations.
How it Works
SortPedia is built for performance and accuracy using modern web technologies.
- Generators for State Algorithms are implemented as Generator Functions, yielding execution control at every step to allow for frame-perfect pausing and rewinding.
- Web Workers Heavy computations and benchmarks run off the main thread, keeping the animations smooth at 60fps even during intense sorting.
- Strict TypeScript Built with strict type safety to ensure implementation accuracy and codebase maintainability.