Back to Projects

AlgorithmExplorer

Completed

Algorithm Benchmarking & Visualization Tool

Built for CSC 114 (Algorithms Analysis & Design). Implements PDQSort, Timsort, AlphaDev Sort (DeepMind AI-discovered), and std::sort alongside Binary Search, Exponential Search, Skip List, and a Learned Index. Benchmarks measure execution time, comparison count, and memory usage across 1K to 100M elements. Bonus: OpenMP parallel sort (1T/2T/4T/8T), 100M scale tests, and CUDA GPU sort with CUB DeviceRadixSort. Python dashboard visualizes all results interactively.

Tech Stack

C++17PythonOpenMPCUDAMatplotlibNumPy

Key Features

PDQSort, Timsort, AlphaDev Sort, std::sort
Binary Search, Exponential Search, Skip List, Learned Index
Benchmarks: Time, Comparisons, Memory
Scales from 1K to 100M elements
OpenMP Parallel Sort (up to 8 threads)
CUDA GPU Sort (CUB DeviceRadixSort)
Interactive Python Visualization Dashboard
Category: Research