How to use algorithm-base: read the animated algorithm notes

What is in algorithm-base?

The repository is a collection of reading materials, not a program. Its notes cover data structures (hash tables, stacks and queues, linked lists, recursion and binary trees), string matching (BF, BM and KMP), and sorting algorithms (bubble, selection, insertion, shell, merge, quick, heap and counting sort).

It also groups LeetCode and Jianzhi Offer interview problems by topic, such as arrays and sorting-based problems, and each problem links to its own write-up.

• Data structures (prerequisites): hash tables, stacks and queues, linked lists, recursion, trees
• String matching: BF, BM and KMP
• Sorting: bubble, selection, insertion, shell, merge, quick, heap, counting
• Binary tree traversals: iterative and Morris versions
• Problem lists: sorting-based problems, linked list, arrays (for example LeetCode 1 Two Sum and Jianzhi Offer 3)

Read online or clone the repository

The README recommends reading online at www.chengxuchu.com because it is more stable than the GitHub files. If you want the notes on your own computer, clone the repository with git.

The notes are Markdown files stored in folders such as animation-simulation, so you can open them in any editor or Markdown viewer.

Study in a sensible order

The README lists the data structure notes first and marks them as prerequisites. Read those before the sorting, string matching and tree sections, because the later notes assume you already know how arrays, linked lists and trees work.

Within each section, read the animation or diagram first, then work through the code and the summary. Pause at each step and predict what happens next before reading on.

• Start with hash tables, stacks and queues, linked lists and recursion
• Then move to binary trees and traversals
• Next cover sorting and string matching
• Finish with the problem lists, which apply these ideas to interview questions

Use the problem lists for interview practice

The problem lists are grouped by topic rather than by difficulty. Pick a topic you have just studied, open the linked problem write-ups and compare your own solution with the step-by-step explanation.

The lists also link to related problems such as LeetCode 27 (remove element) and LeetCode 41 (first missing positive), so you can practise a topic on several problems in a row.

• Choose one topic from the lists
• Attempt the problem yourself before reading the write-up
• Compare your approach with the animated explanation

Know what the repository does not offer

algorithm-base has no install step and no runnable software or library. Its notes are written in Chinese, and the README and linked notes are in Chinese, so readers who do not read Chinese will find it hard to use.

If you want English-language or interactive learning material, compare it with the other projects in the same space, such as labuladong/fucking-algorithm and Hello Algo.