|
|
|
| Authored by: Anonymous on Thursday, April 19 2012 @ 03:58 PM EDT |
It is rather standard code practice.
you are given selection range (say, page numbers from 25 to 55).
Before you even look in the book (the array) you first verify that pages
requested are there. In the book example, the minimum page is 1 and the maximum
page is 600 (or so - maybe the book is War and Peace)
Is the first page desired less than the last page desired (first page < last
page => 25 < 55)?
Is the first page in the book - (page 25 > 0)?
Is the last page there (55 <= size of the book)?
If an error is revealed by any of the tests report it to the requesting person:
1: first page requested is not less than the last page requested
2: the first page requested is not in the book
3: the last page is not in the book.
This is all standard "range checking" facilities that has been taught
as good practice ever since 1960, if not earlier.
All of this applies to any ordered list with an indexing capability. I was
googling for examples, but only found references to lectures going back to Algol
60 history, but not real examples of code from that time...)[ Reply to This | Parent | # ]
|
|
|
|
|
