in reply to searching for strings

You can sort the input and then compare each string with its neighbors instead of using a hash.

Replies are listed 'Best First'.
Re^2: searching for strings
by CountZero (Bishop) on Aug 06, 2007 at 15:20 UTC
    That would not work as ABC9 and ABC10 would not necessarily be next to each other.

    CountZero

    A program should be light and agile, its subroutines connected like a string of pearls. The spirit and intent of the program should be retained throughout. There should be neither too little or too much, neither needless loops nor useless variables, neither lack of structure nor overwhelming rigidity." - The Tao of Programming, 4.1 - Geoffrey James

[reply]
[d/l]
[select]

In Section Seekers of Perl Wisdom