So here’s a little background for the story.
For whatever reason I was under the impression that bubble sort was, in fact, selection sort and was blindly unaware of the existence of selection sort, as a reference.
One night I was lying in bed thinking about sorting algorithms. Alright are you done snickering? Good we can continue. I fell asleep. Around two-thirty in the morning I bolted wide awake, I had an epiphany “Hey what if I wrote a sorting algorithm using a while loop instead of for loops!”
So I did. It worked brilliantly!
Fast forward about a week. I was having a discussion with Daniel, a friend of mine from school. The scenario unfolded something like this.
Me: “Dude I came up with a sorting algorithm, I’m pretty sure it’s faster than bubble sort.”
Daniel: “Really, let’s check it out.”
Me: “Alright cool”
I fire up the laptop and open the file containing my Magnum Opus.
Daniel: “Dude isn’t that bubble sort?”
Me: “No, bubble sort uses the two for loops.”
Daniel: “I’m pretty sure that’s bubble sort.”
Me: “No it's not.”
Accesses wikipedia, loads page outlining bubble sort.
Daniel: “See that’s bubble sort.... At least you thought of it yourself.”
Me: “Just shut up.”
Saturday, April 7, 2007
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment