Google’s Recursion Loop Easter Egg

Related articles

7 Responses

  1. abhishek says:

    Looks like Google has rectified this.

  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)

Leave a Reply

Your email address will not be published. Required fields are marked *