This repository contains the Go source code for the algorithms in the textbook Algorithms, 4th Edition by Robert Sedgewick and Kevin Wayne.

The official Java source code is here.

Make a Go implementation of the library so that a Go programmer can follow this book easily or prefer to demonstrate the algorithms using Go.

Try to keep the interface and variable name consistent with the original book while writing idiomatic go code.

Unlike Java or Python where you can put main function in a file directly. In go the main function has to be in the main package and in the cmd directory by convention. To test each algorithm(data structure), instead of running the file directly, you have to run the file under cmd directory. Example: cmd/bag/main.go

• 1 FUNDAMENTALS
  • Bag
  • Queue
  • Stack
  • UnionFind
• 2 SORTING
  • Selection
  • Insertion
  • Shell
  • Merge
  • Quick
  • Quick3Way
  • MaxPQ
  • TopM
  • IndexMinPQ
  • Multiway
  • Heap
• 3 SEARCHING
  • FrequencyCounter
  • SequentialSearchST
  • BinarySearchST
  • BST
  • RedBlackBST
  • SeparateChainingHashST
  • LinearProbingHashST
• 4 GRAPHS
  • Graph
    • Graph
    • DepthFirstSearch
    • DepthFirstPaths
    • BreadthFirstPaths
    • CC
    • Cycle
    • SymbolGraph
    • DegreesOfSeparation
  • Digraph
    • Digraph
    • SymbolDigraph
    • DirectedDFS
    • DirectedCycle
    • DepthFirstOrder
    • Topological
    • KosarajuSCC
  • MST
    • EdgeWeightedGraph
    • LazyPrimMST
    • PrimMST
    • KruskalMST
  • Shortest Paths
    • EdgeWeightedDigraph
    • DijkstraSP
    • AcyclicSP
    • BellmanFordSP
• 5 STRING
  • LSD
  • MSD
  • Quick3string
  • TrieST
  • TST
  • KMP
  • NFA
  • Huffman
  • LZW

This code is released under MIT.

Issue reports and code fixes are welcome. please follow the same style as the code in the repository and add test for your code.