Complexity Theory & Logarithms
Complexity Theory and Big O notation, and why logarithmic bases don’t matter
Complexity Theory and Big O notation, and why logarithmic bases don’t matter
Slices in Go automatically adjust their size when new values are inserted. O(n) is the time complexity for this operation.
I made a laptop stand out of solid concrete, in the style of brutalist architecture, with themes of urbex and urban decay
Constants in Go, and an observation about the type system. Following on from previous articles about type coercion, another limited form is identified and explored.
An exploration of channel direction in Go, and a perspective on its implications for the type system.