Notebook of algorithms examples in Go
Switch branches/tags
Nothing to show
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Failed to load latest commit information.
shuntingyard
.gitignore
LICENSE
README.md
capped_stack.go
capped_stack_test.go
eratosthenes.go
eratosthenes_test.go
euclid.go
euclid_test.go
josephus_problem.go
josephus_problem_test.go
linked_list.go
linked_list_test.go
main.go
pushdown_stack.go
pushdown_stack_test.go
queue.go
queue_test.go
slice_queue.go
slice_queue_test.go
slice_stack.go
slice_stack_test.go

README.md

Algorithms in Go

This repository is a notebook for data structures and algorithms implemented in Go. Examples are derived from sources listed in references. Each example is in a separate file, with a corresponding file for tests and benchmarks. Since I am new to Go, some code may not be idiomatic. To suggest an improvement, please submit a pull request, create an issue, or schedule some time to pair with me.

Running Tests

$ go test

With benchmarks:

$ go test -bench=.

Pair Programming

Pair program with me!

Check out my schedule and make some time to explore Algorithms in Go.

References