
go ahead... be a heretic
	PerlMonks

Re^2: sort behavior explanation required

by Laurent_R (Canon)

on Apr 20, 2014 at 17:38 UTC ( [id://1082954]=note: print w/replies, xml )

Need Help??

Help for this page

Select Code to Download

Select or download this

$ perl bench_sort.pl
Benchmark: timing 80 iterations of merge, quick...
     merge:  3 wallclock secs ( 3.76 usr +  0.00 sys =  3.76 CPU) @ 21
+.28/s (n=80)
     quick:  2 wallclock secs ( 1.53 usr +  0.00 sys =  1.53 CPU) @ 52
+.32/s (n=80)

Select or download this

$ perl bench_sort.pl
Benchmark: timing 80 iterations of merge, quick...
     merge:  3 wallclock secs ( 3.40 usr +  0.00 sys =  3.40 CPU) @ 23
+.53/s (n=80)
     quick: 199 wallclock secs (198.93 usr +  0.12 sys = 199.06 CPU) @
+  0.40/s (n=80)

Select or download this

$ perl bench_sort.pl
Benchmark: timing 80 iterations of merge, quick...
     merge:  3 wallclock secs ( 3.56 usr +  0.00 sys =  3.56 CPU) @ 22
+.50/s (n=80)
     quick: 199 wallclock secs (197.97 usr +  0.06 sys = 198.03 CPU) @
+  0.40/s (n=80)

Domain Nodelet^?

www.com | www.net | www.org

Node Status^?

node history
Node Type: note [id://1082954]
help

Chatterbox^?

How do I use this? • Last hour • Other CB clients

Other Users^?

Others rifling through the Monastery: (6)

As of 2024-04-19 09:26 GMT

Sections^?

Information^?

Find Nodes^?

Leftovers^?

Today I Learned

Voting Booth^?

No recent polls found