Data Structures and Algorithms
The structures you build by hand and the algorithms that run over them. Every page opens with a diagram you can step through, then writes the thing out in Go.
- Overview /data-structures
- Stack /stack
- Queue /queue
- Ring /ring
- Set /set
- Trie /trie
- Linked List /linked-list
- Doubly-Linked List /doubly-linked-lists
- Quick Sort /quick-sort
- Binary Search /binary-search
- Merge Sort /merge-sort
- Bubble Sort /bubble-sort
- Insertion Sort /insertion-sort
- Graph /graph
- Breadth-First Search /breadth-first-search
- Depth-First Search /depth-first-search
- Dijkstra's Algorithm /dijkstra
- A* Search Algorithm /a-star
- Heap /heap
- Dynamic Array /dynamic-array
- Fibonacci /fibonacci
- Euclidean Algorithm /euclidean
- Manhattan Distance /manhattan-distance
- PageRank /pagerank