between the first map and the grep.sort { $b->[2] <=> $a->[2] }
The output will now be sorted by descending amplitude and you will have only one entry per second.
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
In reply to Re^3: Compare fields in a file
by CountZero
in thread Compare fields in a file
by honyok
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |