algo/

see 127_word_ladder.go

In computer science, the Floyd–Warshall algorithm is an algorithm for finding shortest paths in a weighted graph with positive or negative edge weights (but with no negative cycles).

Max Heap

insert sort stable very useful in small array

draw json number DFA and translate to code

LSD (least significant digit first) string sort Only work for same length string

merge sort stable

Topological sort

Idea from book "Algorithm 4th" weighted quick union implementation

Quick find implementation (Slow union)

Quick union implementation (Slow find)