A couple of sorting algorithms from the CLRS book

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.

Size of longest common subsequence of a pair of strings.

Optimum way of cutting up a rod using dynamic programming.

Determining the optimum number of operations of a product of matrices 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".

Optimal binary search tree using dynamic programming.

Personal implementation of some algorithms in "Introduction to Algorithms", third edition; new repo

The MAGMA Benchmark is designed to evaluate the performance of large language models (LLMs) on classical graph algorithms using intermediate steps.