Perl 5.6 and earlier used a quicksort algorithm to implement sort. That algorithm was not stable, and *could* go quadratic. implementation was replaced with a stable mergesort algorithm sort. Its rather blunt control of the underlying algorithm may # guarantee stability, regardless of algorithm
In reply to Re: sorting agorithm
by Anonymous Monk
in thread sorting agorithm
by abubacker
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |