Predicting Algorithm Runtime Distributions: An In-Context Learning Approach with TabPFN
An interactive numerical analysis dashboard built from scratch to benchmark root-finding algorithms (Bisection, Newton, Secant, Fixed-Point) with live convergence and performance plotting
A Python, Tkinter visualizer to generate mazes and benchmark the execution time of various pathfinding based on algorithms.
Python implementations of fundamental image processing algorithms, including Prokudin-Gorskii plate alignment, exact histogram matching, selective color manipulation, and vectorized blur benchmarking.
Add a description, image, and links to the algorithm-benchmarking topic page so that developers can more easily learn about it.
To associate your repository with the algorithm-benchmarking topic, visit your repo's landing page and select "manage topics."