What language is it in?
If I could do it in Perl I think I'd do something like:
1. Convert array 1 to a hash.
2. Iterate through array 2 and see if it exists in the hash.
Something like:
 | | |
| Code: #!/usr/bin/env perl use 5.010; use warnings; use strict; use File::Slurp; # Set up variables my @array1; my @array2; my @returnArray; # Import word lists my $WORDFILE='/Users/benlavery/scripts/Dict'; @array1 = read_file($WORDFILE); chomp(@array1); $WORDFILE='/Users/benlavery/scripts/DictRev'; @array2 = read_file($WORDFILE); chomp(@array2); # Convert array1 to a hash my %hash = map { $_ => 1 } @array1; # For each item in array2, see if it exists in the hash # If it does exist, add it to the returnArray array. foreach my $item(@array2){ if(exists $hash{$item}){ push(@returnArray, $item); } } # Print the returnArray array with each element on a new line print join("\n",@returnArray),"\n"; | |
| | |
The code above runs on my iMac in the following time:
| | |
| Code: real 0m0.914s user 0m0.553s sys 0m0.063s | |
| | |
Dict and DictRev are files that contain 173122 words. They both contain the same words but DictRev is reversed. Sorting DictRev by general numeric value (sort -g) gets a similar process time.
If I had to do it in Java, I would probably put array1 into a hash table creating hashes of each word, then iterate through array2 creating a hash and seeing if it existed i the hash table.
Not sure on the inbuilt data structures of Cocoa, so not sure on my approach using Objective-C.