Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl: the Markov chain saw
 
PerlMonks  

Re^2: Reordering Arrays?

by bart (Canon)
on Jul 29, 2006 at 09:38 UTC ( [id://564508]=note: print w/replies, xml ) Need Help??


in reply to Re: Reordering Arrays?
in thread Reordering Arrays?

an interesting alternative for those to whom slices are less natural
Though it's nice of Perl to offer alternative ways to achieve the same thing, that are even almost as concise, but that's still no excuse not to learn about array slices. After all, they're an essential part of what makes coding in Perl so elegant.

Replies are listed 'Best First'.
Re^3: Reordering Arrays?
by GrandFather (Saint) on Jul 29, 2006 at 09:50 UTC

    Oh, I fully agree. I was more interested in the benchmark result. I really expected map to be much more expensive than slicing so I was rather surprised by the result. The result holds good for arrays of at least 100_000 elements.


    DWIM is Perl's answer to Gödel

Log In?
Username:
Password:

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

How do I use this?Last hourOther CB clients
Other Users?
Others lurking in the Monastery: (3)
As of 2024-04-26 04:39 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found