In this repo I explore essential algorithms and data structures in the area of Computer Science (using Python & Java)
-
Updated
May 11, 2018 - Python
In this repo I explore essential algorithms and data structures in the area of Computer Science (using Python & Java)
Code for implementing algorithms from clrs
《算法导论》(Thomas H. Cormen, 第三版)中伪代码的c语言代码实现
Computer Science Mathematics Resources
This is a repository of pseudocode implementations discussed in the main text of a classic - 📖Introduction to Algorithms, known as CLRS. All implementations are written in C. The repository is a result of self study of algorithms discussed in CLRS.
Exercises and problems in Introduction to Algorithms 3rd edition
CLRS study. Codes are written with golang.
Rewriting some important structures from CLRS.
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.
Optimal binary search tree using dynamic programming.
Optimal binary search tree using dynamic programming.
Java Implementations for CLRS
This repository contains full implementation of CLRS book in JAVA and Python
This repository contains full implementation of CLRS book in JAVA and Python
Add a description, image, and links to the clrs-study topic page so that developers can more easily learn about it.
To associate your repository with the clrs-study topic, visit your repo's landing page and select "manage topics."