📘 Implementation of the various algorithms from CLRS
-
Updated
Nov 11, 2016 - C++
📘 Implementation of the various algorithms from CLRS
📓Solutions to Introduction to Algorithms
A couple of sorting algorithms from the CLRS book
Database of all algorithms that i studied during my S4 DSA course at NIT Calicut
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
A dynamic programming solution to cutting a rod
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.
Implementation of merge sort
Longest common subsequence using dynamic programming.
Longest common subsequence of a pair of vectors of ints using dynamic programming.
Optimum chain matrix product using dynamic programming.
Dynamic programming solution to the "Word Break" problem on LeetCode.
Implementation and analysis of various sorting algorithms in C++.
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."