Beefy Boxes and Bandwidth Generously Provided by pair Networks
Just another Perl shrine

Re^7: Perl is dying (better sorting than the ST)

by diotalevi (Canon)
on Jan 10, 2007 at 00:57 UTC ( #593807=note: print w/replies, xml ) Need Help??

in reply to Re^2: Better sorting than the ST
in thread Perl is dying

It is one level of indirection harder and perhaps doesn't have as many "cool points."

⠤⠤ ⠙⠊⠕⠞⠁⠇⠑⠧⠊

  • Comment on Re^7: Perl is dying (better sorting than the ST)

Replies are listed 'Best First'.
Re^4: Better sorting than the ST
by Aristotle (Chancellor) on Jan 11, 2007 at 21:03 UTC

    I admit I never thought about the former. I did think of the latter, and itís consistent with one of the weaknesses I see in the Perl community (namely the tendency to pick clever and shorter-looking solutions), which is why I will now often point out this approach when people talk about the ST.

    Hmm. Interesting thought. It wonít stop me from advocating this approach, but itís a much more complete explanation of the STís prevalence than I had before.

    Makeshifts last the longest.

Re^8: Perl is dying (better sorting than the ST)
by parv (Priest) on Jan 10, 2007 at 06:12 UTC
    By "It", did you mean Aristotle's method or GRT|ST?

      Sorting the indexes is one step removed from sorting the elements directly.

      ⠤⠤ ⠙⠊⠕⠞⠁⠇⠑⠧⠊

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://593807]
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others imbibing at the Monastery: (8)
As of 2018-11-15 14:31 GMT
Find Nodes?
    Voting Booth?
    My code is most likely broken because:

    Results (186 votes). Check out past polls.

    • (Sep 10, 2018 at 22:53 UTC) Welcome new users!