Google’s Recursion Loop Easter Egg

Related articles

11 Responses

  1. abhishek says:

    Looks like Google has rectified this.

    • Anonymous Corrector says:

      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.

  2. not a fool says:

    this is a play on the meaning of recursion by google.

  3. Rob says:

    @Jameson – you’re stupid.

    Yay for Google :)

  4. keyboardr says:

    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)

  5. Not a nerd says:

    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

Leave a Reply

Your email address will not be published.