The MAGMA Benchmark is designed to evaluate the performance of large language models (LLMs) on classical graph algorithms using intermediate steps.
-
Updated
Mar 26, 2025 - Python
The MAGMA Benchmark is designed to evaluate the performance of large language models (LLMs) on classical graph algorithms using intermediate steps.
Personal implementation of some algorithms in "Introduction to Algorithms", third edition; new repo
Optimal binary search tree using dynamic programming.
Following: Introduction to Algorithms -- CLRS
Implementations of canonical data structures and algorithms, based on CLRS 3rd edition.
Contains all my code in exercises and problems from "Introduction to Algorithms" , written in Python.
A couple of sorting algorithms from the CLRS book
Size of longest common subsequence of a pair of strings.
Determining the optimum number of operations of a product of matrices using dynamic programming.
Optimum way of cutting up a rod using dynamic programming.
Python implementations of CLRS data structures and algorithms. These are almost line-by-line implementations I wrote for the sake of learning. Not "Pythonic".
Add a description, image, and links to the clrs-algorithms topic page so that developers can more easily learn about it.
To associate your repository with the clrs-algorithms topic, visit your repo's landing page and select "manage topics."