Beefy Boxes and Bandwidth Generously Provided by pair Networks
Keep It Simple, Stupid
 
PerlMonks  

RE: RE: Sorting a list of IP addresses (aka Why I hate Big O)

by tilly (Archbishop)
on Aug 08, 2000 at 01:07 UTC ( #26658=note: print w/ replies, xml ) Need Help??


in reply to RE: Sorting a list of IP addresses (aka Why I hate Big O)
in thread Sorting a list of IP addresses (aka Why I hate Big O)

There is a very interesting point about Perl and algorithmic efficiency. Perl makes it very natural for people to use highly optimized pattern recognition algorithms in the regular expression engine, and a good hashing algorithm.

C, while much faster, makes it far more natural to repeatedly scan lists rather than store a key in a hash and just check exists.

The result is that the same person in many circumsances will find that their Perl code not only is easier to write and read, but outperforms what they would have written in C. Sure, if they wrote their C carefully they would beat Perl every time. But natural Perl idioms tend to be better algorithmically than the natural C approaches, and algorithmic efficiency trumps raw performance.

(This does not hold true for all programmers, YMMV, etc. But it is surprising how often it is true.)


Comment on RE: RE: Sorting a list of IP addresses (aka Why I hate Big O)

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others about the Monastery: (9)
As of 2014-12-29 11:47 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    Is guessing a good strategy for surviving in the IT business?





    Results (187 votes), past polls