Re: recursive array search

state-o-dis-array,
You may well be able to reduce the n^2 loops down to 2n at the expense of some memory. I won't pretend to know the relationship between the keys you are looking for but it looks like the number following the X is a multiple of 12, and the number following the : is an integer counter. It might be as simple as the following pseudo code:

Loop over the array as for ( 0 .. $#array ) {...}
push the index into a hash as push @{ $lookup{ $array[$_] } }, $_;
Loop back over the array as for ( @array ) {...}
Transform each element into the possibilities you are looking for
Lookup the possibilities in the hash to see if the key exists

Cheers - L~R

Comment on Re: recursive array search Download Code

Replies are listed 'Best First'.
Re^2: recursive array search by state-o-dis-array (Hermit) on Oct 01, 2004 at 20:11 UTC
Perfect! This is exactly the type of solution I was looking for. Thanks. To All - Problem solved, thanks for the input. Sorry about the confusion, but I wasn't looking for help with determining a successful match, rather I was concerned with how to reduce my search time by getting away from `foreach $element(@array){ foreach $compare(@array){ } }` [download] FYI - my processing time was cut from 12 minutes to less than two with this suggestion! Much thanks!	[reply] [d/l]

Replies are listed 'Best First'.

Re^2: recursive array search
by state-o-dis-array (Hermit) on Oct 01, 2004 at 20:11 UTC

foreach $element(@array){
   foreach $compare(@array){
   }
}
[download]

[reply]
[d/l]