Error’d: The Hardest Problem

This post was originally published on this site

The Daily WTF

It has been infamously stated that the two hardest problems in computer science are naming, caching, and off-by-one errors. Mixing and matching arrays indexed from 0 with arrays indexed from 1 could be a special-case of the off-by-one error.

The zeroth of a sudden rash of anonymous posters spotted this initial example, coughing “Pre-increment seems somehow inappropriate here.”

Carlos follows up with a third, muttering “The image is pretty self-explanatory. Off-by-one error, maybe? I don’t even know.” Honestly, it took me a moment.

Another topically anonymous donor wonders “Are those $USD or $AUD?” Must be US dollars; in OZ they’d be $aNa.

The last of our anonymous cohort crowed “Vaccination rate is better than I thought.”

Finally, the not entirely anonymous David B. dishes on his disguised employer. “At $WORK to log into some of the

To read the full article click on the 'post' link at the top.