A high level overview of recursion with an analogy that will be familiar to front-end UI programmers.
A quick post about realizing an intersection between my existing knowledge and something new I am learning. Well, maybe they are both new things.
Hastily written post with the results of some free-form Saturday language research.
I took a deep dive into this question, and the answer is: kinda, mostly, yeah! CSS + HTML (duh) + user input is Turing complete. Is it possible to remove the user input part? Then I can re-title this post to be more, ahem, declarative.
This is the first official installment of a new tradition, Binary Birthday, where I re-learn binary every year on my birthday and express my new age as 1s and 0s.
First of all, it’s not my birthday. That said, I had a cool idea for a birthday tradition that I want to record lest I forget it!
The code we humans write cannot be read by computers – it must be translated into machine code. Compilers and interpreters do that, and the browser is an interpreter!
This is the first in a potentially long series about browser mechanics, in my own words. Read on to learn about one of the first steps a browser takes: decoding bytes to Unicode code points.
Is CSS a programming language? What is a “CSS algorithm”? Read on to answer these questions, and to learn how CSS fits into the world of programming and computer science.
My 2017 Year In Review post ended up morphing into a longer article, so for now, here are some goals and plans for 2018. They can be boiled down to WordPress, Computer Science studies, and writing.
Stacks and queues are quite similar in that they are both linear and abstract data structures (meaning they describe the behavior of a different data structure, like a linked list or array). All the action in terms of adding and removing items happens at their ends, and their main difference is in which end that adding/removing happens.
Day 2 of Data Structures…let’s talk about trees! What is a binary tree versus a binary search tree? Isn’t the DOM a tree? All of this and more!
Linked lists are very similar to arrays in that they are a one-dimensional list of elements. Unlike arrays, however, in a linked list, you cannot just jump to index 4, you have to walk through the list, starting with the “head”, or the first element in the list, and work your way through to the fourth element. They are very useful for lists where you need to add/remove elements, but not so useful if you need to search elements.