Gets me everytime :3

You can tell the amount of WT*s score it gave to your code from the expression

Also WillComp to devRant...

Haha, Aspirin or anything lying in front of the screen

Actually I wrote an exam from Algorithmics (The Fundamentals of Programming) yesterday, where I was given a problem where I had to sort an n length array... At first I thought "Oh, that'll Bubble sort, for sure! Easy peasy, lemon squeezy!".
But then the thought came - just a hunch - so I asked: does n have an upper limit? The answer was no, but there was a correction: every number in the array is between 0 and 9. So, goodbye Bubble sort, hello Binsort!

Also, it's a problem, that there is a general confusion on the internet between Bubble-sort and Swap-sort... The difference? Bubble sort is O(n) (when the sorting is really messed up, and the array isn't sorted by just 1 or 2 swaps - then it's just wasted run time), while swap-sort is O(n^2) which we fear...