~telemachus/algorithms

Some basic algorithms in go
Update for golangci-lint
Finish initial binary search tree implementation
Add Insert and Walk functions

refs

main
browse  log 

clone

read-only
https://git.sr.ht/~telemachus/algorithms
read/write
git@git.sr.ht:~telemachus/algorithms

You can also use your local clone with git send-email.

#Algorithms in Go

This repository implements several basic or well-known algorithms in Go.

Nothing here is really mine. In most cases, I’ve simply followed pseudocode from Introduction to Algorithms. Sometimes I adapted a program that I found in A Common-Sense Guide to Data Structures and Algorithms. (Those programs were originally written in Ruby, Python, or Javascript.) In one case, I’ve copied code from Stefan Nilsson.

I wrote this to learn about basic data structures and algorithms and to get more comfortable with Go. You shouldn’t use it for anything that matters, and nobody but me is to blame for the mistakes and bad ideas.