The Internet's only wheelchair-accessible website.
blog
software/engineering
humour
The Badger algorithm
(September 24th, 2006 - 3:08AM)
Here's some proof that I'm a geek: I wrote BadgerBadgerBadger as a C++ program.
#include <iostream>
#include <string>
using namespace std;
class Badger
{
public:
Badger() {cout << "Badger" << endl;}
};
class Mushroom
{
public:
Mushroom() {cout << "Mushroom" << endl;}
};
class Snake
{
public:
Snake() {cout << "Snake" << endl;}
};
void badgerBadgerBadger()
{
bool first = true;
while (1)
{
if (!first)
{
for (int i=0; i<12; i++)
{
Badger *badger = new Badger();
}
for (int i=0; i<2; i++)
{
Mushroom *mushroom = new Mushroom();
}
}
for (int i=0; i<12; i++)
{
Badger *badger = new Badger();
}
for (int i=0; i<3; i++)
{
for (int i=0; i<2; i++)
{
Mushroom *mushroom = new Mushroom();
}
for (int i=0; i<11; i++)
{
Badger *badger = new Badger();
}
}
Snake *snake = new Snake();
if (first) first = false;
}
}
int main(int argc, char* argv[])
{
badgerBadgerBadger();
return 0;
}
permanent link -
digg this post -
0 comments
0 comments
