Looks like he -did- mean recursion... |
It works the same for me.
The funniest part... When I click the link to their suggested version of "recursion", it loops back to the same result – with their "Did you mean:" still there.
Apparently an infinite loop. |
Oh, now I get it.
Very funny, indeed. |
yeah maybe it's google joke..
|
That was really funny in a geeky sort of way. Hehehe. |
Also in German: Rekursion |
Looks like my experiment using Bing instead of Google for 1 whole week isn't going to well:
one-shore.com/aaron/bingrecurs ...
|
Brilliant! This is why I like Google... they have a sense of humor and are not afraid to use it! |
Very Very Nice, & Very Funny, Did you mean CLICK-click -click-click |
Also in hebrew...great easter-egg! |
![[put at-character here]](image/at.gif) Aaron Evans
I'm not able to repro your screen shot. The only way I can get the SERP to include "Panda" and "pregnant" highlighted is to search for these terms.
|
Now I'm hitting myself in the head. I didn't see it coming. I have been studying recursion the last few days and should have got it right away. The call stack will keep stacking up with the function repeatedly calling itself because there is no base case. Theoretically since this causes an infinite loop and is compilable, it will in reality technically eventually stop because there is too much overhead and memory will eventually be exhausted. Depending on what the recursion problem is is a factor (e.g. permuation on A-Z thru a-z or 52 non repetitive char equal to 52! or factorial of 52 or 8.06581752 × 10^67 Yikes. Computer would just eventually freeze up or give you the finger. |
I just posted a link to the Google search on Facebook. A friend clicked the link, and said "I don't get it, what's recursion?". I said "Google it". I couldn't have planned that better... |
Ya I'm with "mrbene", I can't reproduce the screenshot either Aaron Evans. |
