Created by M. Massenzio © 2023. All Rights Reserved
These are a collection of very simple algorithms, implemented in Go, for the purpose of practicing for job interviews.
There are implementation of both Depth-First and Breadth-First search algorithms, in the graph
package.
TODO
: add more algorithms, such as Dijkstra's, and Spanning Trees.
The common
package contains a few common algorithms and utilities, such as:
Queue
andStack
implementationsBinarySearch
andBinarySearchRecursive
TODO
: add tests for all the algorithms.