Stacks & Queues

Stacks and Queues are just about the first data structures people learn about in a traditional Computer Science undergrad environment. Not that I would know this first hand or anything, being a History major and all. But look! CLRS starts off its Data Structures section with Stacks and Queues, so […]

Read More! »

Recursive Functions vs Iterative Looping

Recursion as a concept is one of those hallmarks of Computer Science that seems to stay in the domain of undergraduate studies. That’s because iterative looping is both straight forward and, depending on the language, more performant. Recursion is rarely the right answer to a problem. That is, until it […]

Read More! »

Tail Call Optimizations, Stack Frames, and ES6

One of the most interesting changes that ES6 brought with it is the ability to make use of tail call optimization. This post will explain what a tail call optimization is, how tail call optimization works within a theoretical JavaScript engine, and discuss the rules and conditions of their implementation. […]

Read More! »

Setting Up Apache Subdomains

Subdomains are useful extensions to an already existing domain name. One use-case for subdomains is the creation of memorable web […]

Read More! »

Functional JavaScript: Tic-Tac-Toe Game

Functional programming often leads to some pretty elegant solutions. One of the reasons for this is the paradigms so-called ‘composability’ when compared with, say, C-style imperative programming. Composition in computer science is a way of taking smaller, simpler objects or data types and aggregating them into a more complex whole. […]

Read More! »

SMACSS For Cleaner, More Modular CSS

Small websites with little maintenance and CSS styles existing in a single file don’t need to overly concern themselves with organizing those styles in a systematic way. As a site begins to scale up, however an ever-growing amount of nested selectors and an ever-tighter coupling of HTML structure and CSS […]

Read More! »