|
Authored by: rcsteiner on Thursday, April 19 2012 @ 01:41 PM EDT |
I suspect that bounds checking is as old as programming itself.
The oldest code I've personally worked with are utility libraries written in
UNIVAC 1108 assembly in 1966 as part of UNIMATIC at United Airlines, and many of
those did sanity checking of input values to ensure the programmer didn't want
to accidentally reference something off in hyperspace. IGDM (Guard Mode) errors
are unwelcome guests. :-)
---
-Rich Steiner >>>---> Mableton, GA USA
The Theorem Theorem: If If, Then Then.[ Reply to This | Parent | # ]
|
|
Authored by: Ian Al on Thursday, April 19 2012 @ 01:55 PM EDT |
I think that it checks that the lower bound of the array to be sorted is not
less than zero and that the upper bound is not higher than the top of the
array.
It does seem to be the sort of sanity check that programmers have been exhorted
to put in their programs since Bad Programming (Pat. Pending) was first
invented.
---
Regards
Ian Al
Software Patents: It's the disclosed functions in the patent, stupid![ Reply to This | Parent | # ]
|
|
|
|
|