Code for implementing algorithms from clrs
-
Updated
Jul 15, 2018 - C
Code for implementing algorithms from clrs
Dynamic programming solution to the "Word Break" problem on LeetCode.
Solutions and implementation for CLRS3e with TeXnology enhancement.
My notes for reading the famous book "Introduction to Algorithms" (CLRS)
Computer Science Mathematics Resources
A dynamic programming solution to cutting a rod
Implementation of merge sort
Optimal binary search tree using dynamic programming.
A comprehensive collection of Data Structures and Algorithms implemented in C++, based on the concepts from the book Introduction to Algorithms by Cormen, Leiserson, Rivest, and Stein (CLRS). This repository includes various coding challenges and solutions, with unit tests to ensure correctness.
Repo for algorithms, tests, evaluations and stuff in general.
Cormen et al. algorithms bible
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".
Optimum way of cutting up a rod using dynamic programming.
Exercises and problems in Introduction to Algorithms 3rd edition
Contains all my code in exercises and problems from "Introduction to Algorithms" , written in Python.
Longest common subsequence of a pair of vectors of ints using dynamic programming.
Very detailed Data Structure implementations in C, C++ and Pseudo Code. Pseudo Code is mostly from CLRS book and organized for real world usage. Use this repo for DS reference or Interview prep
Add a description, image, and links to the clrs-book topic page so that developers can more easily learn about it.
To associate your repository with the clrs-book topic, visit your repo's landing page and select "manage topics."