Beefy Boxes and Bandwidth Generously Provided by pair Networks
There's more than one way to do things

Re: IP Address sorting

by tadman (Prior)
on Feb 13, 2001 at 08:13 UTC ( #58077=note: print w/ replies, xml ) Need Help??

in reply to IP Address sorting

japhy's code is certainly very quick, Benchmarking about 43% better than anything I could come up with on short notice. The 'radix_sort' is obviously more efficient for this kind of application than the built in sort of Perl.

However, under Perl 5.6 + strict + '-w', the following change is required to avoid compilation errors:

sub IPsort { map inet_ntoa($_), IP_radix_sort map inet_aton($_), @_; }
The alternative code which Benchmarks in at #2, but has the advantage of simplicity:
sub byip { inet_ntoa($a) cmp inet_ntoa($b) } foreach (sort byip @ip_list) ...
BTW, I tested both with 100_000 random IP addresses by 10 runs (approx 86 to 150s per test).

Comment on Re: IP Address sorting
Select or Download Code
Replies are listed 'Best First'.
Re: Re: IP Address sorting
by japhy (Canon) on Feb 13, 2001 at 19:47 UTC

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others rifling through the Monastery: (6)
As of 2015-11-28 11:30 GMT
Find Nodes?
    Voting Booth?

    What would be the most significant thing to happen if a rope (or wire) tied the Earth and the Moon together?

    Results (741 votes), past polls