Recursive Odd Number Function

Boolean isOdd(int num) { if (num == 2147483647) { return true; } else if (num == 0) { return false; } return isOdd(num+2) }

A pixelated code screenshot shows a recursive Boolean function checking whether a number is odd. The joke is that it only handles the maximum 32-bit integer and zero as base cases, so other inputs recurse indefinitely or overflow instead of returning a result. It is shared as a programmer reaction to flawed recursion and edge-case bugs.

• @ithueti / 1467 2019-10-18
• @right_wing_dev_squads / 3601 2022-03-07
• @right_wing_dev_squads / 5057 2022-10-07