> I have suggested C because if the words are all of the same length then > you have 30000^2 = 90 000 000 000 pairs to test. Sorry, you have (n*(n-1))/2 pairs to test (~ 45 000 000 000). bearophile