I'm sorting some stuff, and sometimes I want to order by a name, and sometimes I want to order by a number. Obviously I can't do it all using <=>, but I can sort numbers using cmp. I was wondering what sort of a performance hit I would get using cmp on integers, rather than using some sort of coderef solution, but I find the results of a benchmark rather strange..
Benchmark: running comp, space, each for at least 3 CPU seconds...
comp: 4 wallclock secs ( 3.03 usr + 0.01 sys = 3.04 CPU) @ 89
space: 5 wallclock secs ( 3.12 usr + -0.02 sys = 3.10 CPU) @ 79
What's up with that?
Replaced literal gt and lt with html