back-to-school

command module
Version: v0.0.0-...-1a5aa76 Latest Latest
Warning

This package is not in the latest version of its module.

Go to latest
Published: Jul 1, 2020 License: MIT Imports: 1 Imported by: 0

README

Back to School

Algorithms & data structures

Implementation of various algorithms and data structures, with the aim to learn Go.

References

  • Algorithms & Data Structures, Jürg Nievergelt, Klaus H. Hinrichts, 1993 Prentice-Hall
  • Introduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, 1997 MIT Press
  • Algorithms and Data Structures, Niklaus Wirth 1985 (2004)

Useful Resources

Go Specific Resources

Documentation

The Go Gopher

There is no documentation for this package.

Directories

Path Synopsis
apps
augmentedstruct/lrucache
Example usage: cache := Constructor(capacity); value := cache.Get(key); cache.Put(key, value);
Example usage: cache := Constructor(capacity); value := cache.Get(key); cache.Put(key, value);
graph/wordladder
Given two words (beginWord and endWord), and a dictionary's word list, find the length of shortest transformation sequence from beginWord to endWord, such that: * Only one letter can be changed at a time.
Given two words (beginWord and endWord), and a dictionary's word list, find the length of shortest transformation sequence from beginWord to endWord, such that: * Only one letter can be changed at a time.
bits
data
design
number
sort
radixsort
Radix Sort in Golang
Radix Sort in Golang
struct
prioqueue
Package prioqueue provides a fixed-length priority queue using a heap.
Package prioqueue provides a fixed-length priority queue using a heap.
tree/heap/binaryheap
Package heap provides a fixed-length binary heap.
Package heap provides a fixed-length binary heap.

Jump to

Keyboard shortcuts

? : This menu
/ : Search site
f or F : Jump to
y or Y : Canonical URL