in reply to Searching parallel arrays.
I have the idea of implementing something like a modified Boyer-Moore search on your data structure, but your description and data don't match:
The rule is each array contains a sorted (ascending) sequence of non-contiguous, unique integers, but my @a3 = ( 205, 206, 315 ); contains the two contiguous numbers 205 and 206.
If the data is wrong and the description is right, my algorithm would be to
I think this algorithm optimizes discarding non-matches over finding matches.
|
|---|
| Replies are listed 'Best First'. | |
|---|---|
|
Re^2: Searching parallel arrays.
by Not_a_Number (Prior) on Dec 08, 2006 at 15:46 UTC | |
by Corion (Patriarch) on Dec 08, 2006 at 15:48 UTC | |
|
Re^2: Searching parallel arrays.
by BrowserUk (Patriarch) on Dec 08, 2006 at 20:54 UTC |