#38336 (4/214) ↑Funny ↓Awful ⚐Flag
<elver> Interesting. There was a huge computer referred to as '786' in today's Garfield episode.
<elver> What's odd is that it took the computer several seconds to search a database of 72000 entries.
<elver> Shouldn't take that long.
<elver> Unless the operation is I/O-bound.
<elver> The search itself should be O(n) largely.
<LordBob> elver: might be a 3.5 Khz chip
<Epoch71> binary search :D
<elver> LordBob, actually, it was a cardboard box with lights on it and a guy reading a newspaper inside who turned the lights on and off.
<elver> Still, it was unrealistic.Comment: The computer was looking for the best match, so yes, unless you do preprocessing, it ought to be O(n)...
|