Perl has a built in sorting mechanism based on the qsort algorithm, which is usually *much* faster than a bubble sort.
For examples and some info on using the built-in sort, you can start off with perlfunc:sort, but I also recommend the Complex sorting node in the Tutorials section.
Hope that helps!
perl -e 'print "How sweet does a rose smell? "; chomp ($n = <STDIN>); +$rose = "smells sweet to degree $n"; *other_name = *rose; print "$oth +er_name\n"'
In reply to Re: bubble sort problems
by arturo
in thread bubble sort problems
by BradThePerlNeophyte
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |