## KMP String Search Algorithm

Explaination of Knuth–Morris–Pratt string-searching algorithm (or KMP).

Explaination of Knuth–Morris–Pratt string-searching algorithm (or KMP).

Do you know which is the slowest sorting algorithm? Let’s have fun with bogosort, sleep sort, and slow sort!

Breadth-First-Search(BFS) explained with visualization, a queue is used in the implementation.

Depth-First-Search(DFS) explained with visualization, contains implementations of iterative version and recursive version.

In this post, we will learn how disjoint-set(union-find) data structure works, then we implement a maze generator with it.

The random number is an important topic in computer science. In this post, we will discuss how random numbers are generated, how to use random numbers to shuffle cards.

Use quicksort as an example, explain my method for learning algorithms effectively, explore the differences between imperative and functional programming styles.

This is a roadmap and tips for you to learn data structures and algorithms. This post also contains books and resources for learning.

In this post, we will write a function to randomize(shuffle) a JavaScript array.

Solution for LeetCode: Merge Two Sorted Lists