There are only two hard things in computer science: cache invalidation, naming things, and off-by-one errors
"I'm not back." - Bill Harding, Twister
There are only two hard things in computer science: cache invalidation, naming things, and off-by-one errors
"I'm not back." - Bill Harding, Twister
There are only two hard things in computer science: cache invalidation, naming things, and off-by-one errors
"I'm not back." - Bill Harding, Twister
Originally posted by Anu Ram:
The mathematician should say 6. The algorithm is to count the number of alphabets in the barman's number. Is that right?![]()
[ February 16, 2004: Message edited by: Anu Ram ]
I am a Papad
Originally posted by Anu Ram:
The mathematician should say 6. The algorithm is to count the number of alphabets in the barman's number. Is that right?![]()
Spot false dilemmas now, ask me how!
(If you're not on the edge, you're taking up too much room.)