Binary Trees and Traversals

Everyday Algorithms: This may be a bit of a divergence from my regular “Everyday Algorithms” series, however I feel it is important. Thus far, most algorithm’s I have discussed have been directly related to real life events. I.e. flipping pancakes, planning a road trip, etc. That being said, I feel it is important to cover […]

Merge Sort in Go (Golang)

Merge Sort was invented by John von Neumann in 1945, and is an algorithm belonging to the “divide and conquer” class of algorithms. Meaning, the algorithm splits an input into various pieces, sorts them and then merges them back together. Runtime of Merge Sort If we rephrase this algorithm: Divide the array into various “chunk” to process Merge the […]

OpenBKZ – alpha v0.4.6 – Released!

It’s been a while since I released a new version of OpenBKZ, and I think it is about time. Oh, and I made a logo! Unfortunately, as many of you know I haven’t been able to work on OpenBKZ as much as I would like recently. However, as the semester (of my senior year!) of […]