Given an array of "words" that are to be sorted, and an array of characters which make up those words (aka the 'alphabet'. This second array is already sorted in 'alphabetical' order. Assume that no character is repeated in this second array. Also assume that no other characters are present in the words. Also assume that everything is already in the 'lower case' form. Note that the number of characters in the alphabet is arbitary.

Find the perl golf (fewest # of characters in the code) that will sort the words based on this alphabetic order. Some test cases that you should test against would be:

@alpha = ('a'..'z');
@l = o( \@alpha, \@words );  
# should give same results as @l = sort { $a cmp $b } @words;

@alpha2 = reverse ('a'..'z');
@l2 = o( \@alpha2, \@words );
# should give same results as @l2 = reverse sort { $a cmp $b } @words;
+ or @l2 = sort { $b cmp $a };
[download]

Update to clear up the confusion as merlyn's replies below indicate, the 'alphabet' is not necessarily the typcial 26-character english alphabet, and may consider of any character including and not limited to numbers, punctuation, accented characters, and so forth. For example, one could call the 'alphabet' for hexadecimal numbers as (0..9A..F).