How could I not remember that?!

I have two that come to mind:

First one was a piece of software used to simulate some military hardware interface. Since I do not have access to the code anymore, this is a recreation from memory:

// The following code is sub-par. We know. There have been several
// attempts to improve the code, but all attempts have failed. To warn
// future brave souls, increase the counter when you admit defeat.
//
// Defeated souls count: 17
...

And another one, which I merely have observed on the Internet (Edit: As pointed out by Enemby; this one is from xkcd):

int random() {
    return 4; // chosen by fair dice roll; guaranteed to be random
}

How is this any different from a straight forward breadth-first search? Ok, it has been implemented on a GPU, but otherwise?

Disclaimer: It's been ages since I did anything related to "algorithms and data structures". It's also quite possible I'm stupid O_O