pseudo code
- From: nicolas_laurent545@xxxxxxxxxxx
- Date: 29 Sep 2006 09:11:15 -0700
Not a programmer but need to understand this routine. Could someone
explains to me in plain words what
this pseudo code means. If you provide an example it would be very
appreciated. I understand the first part.
Many thanks
Find set of documents D in which all keywords (k1...km) in phrase occur
(using AND query processing).
Intitialize empty set, R, of retrieved documents.
For each document, d, in D:
Get array, Pi ,of positions of occurrences for each ki in d
Find shortest array Ps of the Pi's
For each position p of keyword ks in Ps
For each keyword ki except ks
Use binary search to find a position (p - s + i) in
the array Pi
If correct position for every keyword found, add d to R
Return R
.
- Follow-Ups:
- Re: pseudo code
- From: Mark P
- Re: pseudo code
- Prev by Date: Re: "It doesn't matter if you're a good programmer, it's the syntax that matters"
- Next by Date: Re: Clueless (Was:100 Years of E=mc2 : A critic is Nameless, Placeless, Identityless ?)
- Previous by thread: Re: Memory leak detectors
- Next by thread: Re: pseudo code
- Index(es):
Relevant Pages
|
Loading