2 thoughts on “I Trust Everyone Here Had a Reflective Teenth…?”

  1. Don’t you just love it when they shoot up a funeral?

    In the Computer Science biz, we call that “recursion.”

    Assume a starting case where there is a group some postitive number of Homies. Let’s call that initial number ‘N’.

    Homey ‘N’ gets shot. At his funeral, some other Homey shoots Homey ‘N-1’. Continue with funerals and shootings at funerals, until the last Homey, Homey ‘0’, gets high and shoots himself.

    Homey ‘0’ getting shot is the “end case” and is how our “recursive algorithm” avoids an infinite loop.

    Come to think of it, why not just let the Homies sort themselves out?

    1. More precisely, the funeral case is called “tail recursion.”
      Now we must answer the question: is it an aptronym?

Comments are closed.

Verified by MonsterInsights