JockoHelios: your reply indicates you have grasped the points others are making. However, I see a potential stumbling block looming before you.
The default ordering of sort is lexicographic-ascending (see Alphabetical order and Lexicographical order as potential starting points for info on this), and sort implicitly converts its arguments to strings for this sort and effectively compares elements with the cmp stringwise-comparison operator; see Equality Operators in perlop. However, the way you are initializing your @TaR array suggests you are dealing with numbers rather than strings.
If you do intend to work with numbers, be aware that lexicographic sorting can produce very surprising results. Note in the example below that 10 sorts before 2 and 20 before 4 in the default sort. The solution is to supply an explicit numeric-comparison block to sort. (The <=> 'spaceship' numeric-comparison operator is also discussed in Equality Operators along with cmp.) I hope this helps.
>perl -wMstrict -le "my @TaR = (8, 2, 5, 20, 4, 10, 5, 6, 1, 8); print qq{original: @TaR}; ;; my @sorted_lex = sort @TaR; print qq{lexical: @sorted_lex}; ;; my @sorted_num = sort { $a <=> $b } @TaR; print qq{numeric: @sorted_num}; " original: 8 2 5 20 4 10 5 6 1 8 lexical: 1 10 2 20 4 5 5 6 8 8 numeric: 1 2 4 5 5 6 8 8 10 20
In reply to Re: reverse sort arrays in subroutines
by AnomalousMonk
in thread reverse sort arrays in subroutines
by JockoHelios
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |