Data Access Times Translated to Distances (with Pictures)
This well-known article, Numbers Everyone Should Know, was intriguing, but it was hard to mentally get a handle on the scale of the numbers. Here are »
An Experiment in Sorting in Linear Time
Yes, you can sort in linear time, as long as you're avoiding comparisons. Radix sort and counting sort are two examples. They both avoid comparisons, and »
How to Run Valgrind in CLion, for C and C++ Programs
I needed this for myself, and Googled around but didn't find anything satisfactory, but now after a little work, I'm all set with Valgrind. Wouldn't you »
How to Obtain and Automatically Renew SSL Certs with Let's Encrypt on Node.js
Thanks to Let's Encrypt, everyone can enjoy the security of an SSL-protected domain. To be fair, there are still a few places where their automated system »
Working to Become a Unix/Linux Master Plumber
I've been reading an old but great book, The Unix Programming Environment (1984), by Brian Kernighan (of K&R C fame) and Rob Pike. I »
UX Makeover: My Terrible Pricing Page
I can call it terrible, because I designed it. -- me The Just Really Bad Page Last week I spent some time overhauling the pricing page »
Priority Queues: Heap Implementation
I made a departure after studying binary search trees to visit priority queues and heaps. I had planned to do this one later, but it kept »
Exploring Endianness (Octet Ordering)
As I get deeper into my computer science studies, I'm learning about Endianness. More on this subject here: https://en.wikipedia.org/wiki/Endianness Endianness is »
Binary Trees
I've moved on to trees, and I have many trees to cover. The types of trees I'm studying: binary search tree: BST red/black tree splay »
Spending a Couple Days on Hashing Functions
In my study of data structures, I've made it to hash tables. I'm spending a little extra time on this one, because there is some math »