algorithms/

Package hash implements a hash table.

Package list implements of a doubly link list in Go.

Package queue implements of a circular queue.

Package stack asks the student to implement a stack in Go.

Package binary is an implementation of a balanced binary tree.

Program creates customers for the simulation of the sleeping barber problem implemented in the shop package.

Package shop implements the sleeping barber problem.

Package freq provides support for find the frequency in which a rune is found in a collection of text documents.

This is a simple example put together to help a friend with the idea of not over-engineering a pubsub pattern.

Package vlq implements VLQ encoding/decoding.

Package binarysearch provides an example of a binary search implementation.

Package interpolationsearch provides an example of an interpolation search implementation.

Package jumpsearch provides an example of a jump search implementation.

Package linearsearch provides an example of a linear search implementation.

Package main simulate the "Birthday problem".

Package main simulate two-sice rolls.

Simulation of "Monty Hall problem" https://en.wikipedia.org/wiki/Monty_Hall_problem

Calculate the value of π using simulation.

Package main simulate precision of a medical test.

Implementation of Bubble sort in Go.

Package heap implement the heapsort algorithm in Go.

Package insertionsort implement of Insertion Sort algorithm in Go.

Package quicksort implementation of Quick sort algorithm in Go.

Package selectionsort implement of Selection Sort algorithm in Go.