Indoor enthusiast. Co-founder of Stack Overflow and Discourse. Disclaimer: I have no idea what I'm talking about. Let's be kind to each other. Find me
programming languages
In a recent web search, I found the following comment in a programming.reddit.com thread from eight months ago, completely by accident: I think prog.reddit will continue to move in phases... a couple of days ago, someone complained about a drop-off in Haskell articles, today there were 4
blogging
Anil Dash has been blogging since 1999. He’s a member of the Movable Type team from the earliest days. As you’d expect from a man who has lived in the trenches for so long, his blog is excellent. It’s well worth a visit if you haven’t
sorting algorithms
The default sort functions in almost every programming language are poorly suited for human consumption. What do I mean by that? Well, consider the difference between sorting filenames in Windows explorer, and sorting those very same filenames via Array.Sort() code: Explorer shell sortArray.Sort() Quite a difference. I can
security
Jon Galloway and I got into a heated debate a few weeks ago about the efficacy of anti-virus software. My position is that anti-virus software sucks, and worst of all, it doesn’t work anyway. That’s what I’ve been saying all along, and it’s exactly what I
government
Today’s lesson comes to you courtesy of your local Department of Transportation: The Utah DOT is spending $6 million on a feasibility study for a bridge across a lake. Meanwhile, the DOT doesn’t have enough money to put up traveler information video cameras at dangerous mountain passes and
programming languages
In case you hadn’t noticed, it’s that time of year again: let the wholesale buying of crap begin! As a technology enthusiast with a bad impulse purchase habit, I get a lot of complaints that I am difficult to buy for. That’s sort of intentional. I spent
algorithms
In my previous post on shuffling, I glossed over something very important. The very first thing that came to mind for a shuffle algorithm is this: for (int i = 0; i < cards.Length; i++) { int n = rand.Next(cards.Length); Swap(ref cards[i], ref cards[n]); } It’s
data structures
One of the most beloved of all data structures in computer science is the hash table. A hash table is a data structure that associates keys with values. The primary operation it supports efficiently is a lookup: given a key (e.g. a person’s name), find the corresponding value
customer service
In this interview with Werner Vogels, the CTO of Amazon, he outlines how Amazon’s developers stay in touch with their users: Remember that most of our developers are in the loop with customers, so they have a rather good understanding about what our customers like, what they do not
user experience
Has this ever happened to you? You’re merrily typing away in some application, minding your own business, when – suddenly – a dialog pops up and steals the focus from you. At best, your flow is interrupted. You’ll have to switch back to the window that you were using, figure
arrays
Pop quiz, hotshot. How would you write code to shuffle a deck of cards? I was thinking about this after reading Mike’s card-shuffling algorithm woes: Here’s where the non-CS mind comes into play. My first thought was to generate an unshuffled deck as an array-like structure — all cards
user experience
Frets on Fire is an open source clone of Guitar Hero. It’s a great idea. Think of all the user-created songs we could play! My excitement quickly faded after I downloaded it and tried it out. I’ll be first in line to champion gameplay over graphics, but the