I am a retired programmer, and I haven't had a lot of trouble with the couple of thousand lines of Perl I have written, except remembering to always put in curly braces. But I don't know anything about the Perl community.
While looking at the documentation for the sort function, I noticed it complaining about the shortcomings of the quick sort. I share that feeling and I have developed a single-buffered count sort that is faster than the quick sort and a lot more stable. It would have to be integrated into Perl differently than the quick sort, so it would probably be best to have both options. You can get details here: http://www.mcky.net I would be happy to have that algorithm incorporated into Perl, but I don't know who talk to. Any help would be appreciated. Marion McCoskey http://www.mcky.net -- To unsubscribe, e-mail: beginners-unsubscr...@perl.org For additional commands, e-mail: beginners-h...@perl.org http://learn.perl.org/
