|
|
|
|
|
|
by layer8
1146 days ago
|
|
|
You pipe the sorted list into awk (for example) and append the second field to a list as long as the value of the first field remains the same. Whenever the value of the first field changes, and in the END block, you output the list (which contains the matching anagrams) and reset it to empty. No hash table needed, just splitting the line into the two fields, equality comparison, and appending values to a list. |
|
|