Re: How to sort in this upper / lower case?

Aristotle's solution is fastest (about 6x faster), even when modified for proper ordering, but it's not terribly intuitive. I'd personally go with slower and easier to understand:

@array = sort { lc($a) cmp lc($b) || $b cmp $a } @array;
[download]

This does more or less the same thing as the first solution, only neater.

Comment on Re: How to sort in this upper / lower case? Download Code

Replies are listed 'Best First'.
Re^2: How to sort in this upper / lower case? by Aristotle (Chancellor) on Dec 27, 2005 at 09:31 UTC
is fastest (about 6× faster) Actually, you can’t make such a blanket statement. It might be 2 or 3× slower if the dataset is small, like the sample dataset in the OP’s post (I didn’t bother to check). But it can also easily be 100× faster if the dataset is humongous. Results will vary by dataset size, so you can’t give numbers. Another aspect not to be forgotten is that it always takes twice the memory. Makeshifts last the longest.	[reply]

Replies are listed 'Best First'.

Re^2: How to sort in this upper / lower case?
by Aristotle (Chancellor) on Dec 27, 2005 at 09:31 UTC

is fastest (about 6× faster)

Actually, you can’t make such a blanket statement. It might be 2 or 3× slower if the dataset is small, like the sample dataset in the OP’s post (I didn’t bother to check). But it can also easily be 100× faster if the dataset is humongous. Results will vary by dataset size, so you can’t give numbers.

Another aspect not to be forgotten is that it always takes twice the memory.

Makeshifts last the longest.

[reply]