Skip to content

code for practice in book <grokking algorithms>, written in python2.7

Notifications You must be signed in to change notification settings

yucicheung/grokking_algorithms_practice

Repository files navigation

Grokking Algorithms Code

Code to implement the algorithms mentioned in book Grokking Algorithms.

I took reference from the official repository to name my folders.

Also, one image from official repository is used in here.

Statement

If you want to reprint any file included in my repository, please reserve the link of this repo. 如要转载,请保留本仓库链接。

Coding Language

  • Python 2.7

Algorithms List

  • 01.Binary search.
  • 02.Selection sort.
  • 03.Recursion.
  • 04.Quicksort.
  • 05.Hash tables.
  • 06.Breath-first search.
  • 07.Dijkstras algorithms.
  • 08.Greedy algorithms.
  • 09.Dynamic programming.
  • 10.K Nearest Neighbors.
  • 11.Where to go next.

Notice

  • Under the folder of each chapter includes a README.md file that records my notes for that chapter, and is written in Chinese(每章文件夹中都包含有中文笔记).
  • My implementation might be diffrent from that in book, it's constructed in a more undestandable way.

About

code for practice in book <grokking algorithms>, written in python2.7

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages