Re: Cobol Linear search Vs Perfrom Until
docdwarf_at_panix.com
Date: 07/17/04
- Next message: docdwarf_at_panix.com: "Re: Cobol Linear search Vs Perfrom Until"
- Previous message: docdwarf_at_panix.com: "Re: Cobol Linear search Vs Perfrom Until"
- In reply to: Michael Mattias: "Re: Cobol Linear search Vs Perfrom Until"
- Next in thread: Michael Mattias: "Re: Cobol Linear search Vs Perfrom Until"
- Reply: Michael Mattias: "Re: Cobol Linear search Vs Perfrom Until"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Date: 17 Jul 2004 10:30:56 -0400
In article <kVYJc.1717$4L7.1361@newssvr33.news.prodigy.com>,
Michael Mattias <michael.mattias@gte.net> wrote:
[snip]
>Do your binary search (SEARCH ALL) on your sorted table... when you get a
>hit, decrease your index in a loop to find where "target" values start in
>table, then scan though them in forward direction until you find the one you
>want or the key changes; that is, let SEARCH ALL get you "on the correct
>block" and then walk from house to house.
This is the 'peeking and poking, above and below' which makes me...
uncomfortable.
DD
- Next message: docdwarf_at_panix.com: "Re: Cobol Linear search Vs Perfrom Until"
- Previous message: docdwarf_at_panix.com: "Re: Cobol Linear search Vs Perfrom Until"
- In reply to: Michael Mattias: "Re: Cobol Linear search Vs Perfrom Until"
- Next in thread: Michael Mattias: "Re: Cobol Linear search Vs Perfrom Until"
- Reply: Michael Mattias: "Re: Cobol Linear search Vs Perfrom Until"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Relevant Pages
|
|