Problems? Is your data what you think it is?  
PerlMonks 
(Golf) Keysortby demerphq (Chancellor) 
on Feb 14, 2002 at 14:20 UTC ( #145450=perlmeditation: print w/replies, xml )  Need Help?? 
Originally this came up when I was trying to figure out a useful generic sort order for the keys of a hash. I wanted it so that if the keys were numeric they would get sorted numerically, and if the keys were alphanumeric they would get lexicographical ordering. Then the thought came up what happens if there are both? Answer: Put the numbers at the top and the words at the bottom. But what happens if we have keys like 1 1a 2 2a 2b? Well they should be sorted into the numeric portion....
RESULTS SO FAR
So here is the specification for the golf: Write a subroutine that takes a list of keyvalues, sorts them according to the below specification and returns the sorted list.
An example input (in csv) is 1a, 2a, a10, 1, 0, 0alpha, 2, AbBa, 10, 13bravo, 42, 13, adam1, 20b, abc, aBC, 18, 92, Abc, Arthur, Bravo, 25, 11a, 12a, abba Which should produce the output list 13bravo, 0, 0alpha, 1, 1a, 2, 2a, 10, 11a, 12a, 13, 18, 20b, 25, 42, 92, Abc, AbBa, Arthur, Bravo, aBC, a10, abba, abc, adam1 There is no requirement to print out the output, only to return it in the correct order. A slight twist on this problem is to do the same thing above, but substituting a dictionary sort order for the lexicographical sortorder. (Dictionary sort order is where non alphabetic chars are removed and case is irrelevant.) In this case the output for the above input would be 13bravo, 0, 0alpha, 1, 1a, 2, 2a, 10, 11a, 12a, 13, 18, 20b, 25, 42, 92, a10, AbBa, abba, abc, aBC, Abc, adam1, Arthur, Bravo As I'm interested in effiency as well as code size I will rate the entries in both ways, although you can submit different subroutines for both. Of course if the smallest is also the fastest then it wins overall... Anyway, I hope this is interesting to you all, it certainly was fun working on it for me. Oh, and heres my attempts, but I'm sure they won't be winners.
So my lexicographical solution is 185 chars, and my dictionary solution is 195... Now lets see how many chars I wasted... ;) PS Im really interested to see if someone can come up with a GRT version of the sort, so bonus points if you can do it with a GRT instead of an ST, and even more bonus points for doing it without either...
Yves / DeMerphq
Back to
Meditations

