Google’s Recursion Loop Easter Egg
Google never fails to entertain us. This time when you search for Recursion on Google, it keeps on running spell check and displays Did you mean: recursion again and again.
Recursion is the term usually used in Computer Science and this word generally means – to have an activity again and again, forever because the activity itself consists of the same activity. It is like two mirrors facing each other and displaying an infinite trail of opposite images.
In recursion, the objects are repeated infinite times. The iteration runs forever. Google displays this quality when you search for recursion.
Despite clicking on recursion from spell checker – Did you mean, Google will keep on displaying it. Though the spelling is right, Google keeps on telling it again and again.
Try – http://www.google.com/search?hl=en&q=recursion
[via Reddit]
Looks like Google has rectified this.
that wuz stupid
Well, the whole joke is that recursion is when an object is defined in terms of itself. This means that when Google’s spell checker shows “Did you mean: recursion” when you search “recursion”, the spell checker is defining the webpage in terms of itself. So this isn’t stupid, but if you want to see an actual example of stupidity, I have 2 words for you: Look within.
this is a play on the meaning of recursion by google.
See also: http://www.gtricks.com/google-tricks/funny-recursion-loop-display/
im in loooooowoqop
That was good
@Jameson – you’re stupid.
Yay for Google :)
Recursion doesn’t necessarily go on forever. There is almost always a “base case” whereby the recursive function stops calling itself. For instance the factorial function can be defined as f(x) = x * f(x-1) [if x>1] f(1) = 1. A function that continues to go on forever becomes a problem, because it would never return anything. This usually happens when the base case is poorly done or it receives an input that never reaches the base case (in the previous example, 2.5 or -1 would cause this problem)
recursion keyboardr July 17, 2010 at 10:00 pm
Recursion doesn’t necessarily go on forever. There is almost always a “base case” whereby the recursive function stops calling itself. For instance the factorial function can be defined as f(x) = x * f(x-1) [if x>1] f(1) = 1. A function that continues to go on forever becomes a problem, because it would never return anything. This usually happens when the base case is poorly done or it receives an input that never reaches the base case (in the previous example, 2.5 or -1 would cause this problem)
Ehm SHUT UP YOU NERD