|
|
|
| Think about Loose Coupling | |
| PerlMonks |
Re^2: Binary Search - revisitedby educated_foo (Vicar) |
| on Nov 17, 2006 at 04:20 UTC ( [id://584659]=note: print w/replies, xml ) | Need Help?? |
|
If an SV is more than 2 bytes long (which it is), this is not actually a bug. You'll run out of addressable memory before falling off your array. Really, this "every binary search ever has a bug" meme is silly.
In Section
Cool Uses for Perl
|
|
||||||||||||||||||||||