# algorithm

**Repository Path**: ha0zhang/algorithm

## Basic Information

- **Project Name**: algorithm
- **Description**: 《算法》(第4版, Sedgewick著) 的Golang实现
- **Primary Language**: Go
- **License**: Apache-2.0
- **Default Branch**: master
- **Homepage**: None
- **GVP Project**: No

## Statistics

- **Stars**: 0
- **Forks**: 0
- **Created**: 2022-05-24
- **Last Updated**: 2024-08-03

## Categories & Tags

**Categories**: Uncategorized

**Tags**: None

## README

Algorithm (Sedgewick, 4th) implemented in golang.  
[Document](https://pkg.go.dev/github.com/howz97/algorithm)

## [Basic](basic)
  * Stack
  * Queue
    * Array List
    * Linked List
  * Set
  * Union-Find
## [Sorting](sort)
  * Bubblesort
  * Heapsort
  * Insertsort
  * Mergesort
  * Quicksort
  * Selectsort
  * Shellsort
## Searching
  * [Binary Search Tree](search/binarytree.go)
  * [AVL Tree](search/avl.go)
  * [Red-Black Tree](search/redblack.go)
  * [Hash Table](search/hashmap.go)
## [Graphs](graphs)
  * Directed Graph
    * BFS
    * DFS
    * Reachability
    * Strongly Connected Components (kosaraju)
    * Bipartite Graph
    * Topological Sorting
    * Ring Detection
  * Undirected Graph
    * Subgraph
    * Ring Detection
  * Minimum Spanning Tree
    * Lazy-Prim
    * Prim
    * Kruskal
  * Shortest Path
    * Dijkstra
    * Topological
    * BellmanFord
## Strings
  * [String Sort](strings/sort)
    * Most-significant-digit-first
    * Three-way String Quicksort
  * [Trie](strings/trie)
    * R-way Trie
    * Ternary Search Trie (TST)
  * [Substring Search](strings)
    * Knuth-Morris-Pratt
    * Boyer-Moore
    * Rabin-Karp
  * [Regular Expression](strings/regexp)
  * Data Compression
    * [Huffman](strings/compress/huffman.go)
    * [LZW](strings/compress/lzw.go)
## [Priority Queues](pq)
  * Heap
  * Leftist Heap
  * Binomial Heap