Old Spanish alphabetical order

Question

Before 1994, Spanish dictionaries used alphabetical order with a peculiarity: digraphs ll and ch were considered as if they were single letters. ch immediately followed c , and ll immediately followed l. Adding the letter ñ, which follows n in Spanish, the order was then:

a, b, c, ch, d, e, f, g, h, i, j, k, l, ll, m, n, ñ, o, p, q, r, s, t, u, v, w, x, y, z

Since 1994 ll and ch are considered as groups of two letters (l,l and c,h respectively), and thus alphabetical order is the same as in English, with the exception of the letter ñ.

The old order was definitely more interesting.

The challenge

Input a list of zero or more words and output the list sorted according to the old Spanish alphabetical order. Sorting is between words (not between letters within a word). That is, words are atomic, and the output will contain the same words in a possibly different order.

To simplify, we will not consider letter ñ, or accented vowels á, é, í, ó, ú, or uppercase letters. Each word will be a sequence of one or more characters taken from the inclusive range from ASCII 97 (a) through ASCII 122 (z).

If there are more than two l letters in a row, they should be grouped left to right. That is, lll is ll and then l (not l and then ll).

Input format can be: words separated by spaces, by newlines, or any convenient character. Words may be surrounded by quotation marks or not, at your choice. A list or array of words is also acceptable. Any reasonable format is valid; just state it in your answer.

In a similar way, output will be any reasonable format (not necessarily the same as the input).

Code golf, shortest wins.

Test cases

In the following examples words are separated by spaces. First line is input, second is output:

llama coche luego cocina caldo callar calma
caldo calma callar cocina coche luego llama

cuchara cuchillo cubiertos cuco cueva
cubiertos cuco cuchara cuchillo cueva

"Words" can be single letters too:

b c a ch ll m l n
a b c ch l ll m n

or unlikely combinations (remember the rule that l's are grouped left to right):

lll llc llz llll lllz
llc lll lllz llll llz

An empty input should give an empty output:

Of course, this order can be applied to other languages as well:

chiaro diventare cucchiaio
cucchiaio chiaro diventare

all alternative almond at ally a amber
a almond alternative all ally amber at

Answer 1

Pyth, 14 13 bytes

Update: saw this got accepted and noticed a trivial 1 byte golf. Whoops.

:D"ll|ch|."1Q

Try it online. Test suite.

For each word, find all non-overlapping matches for the regex ll|ch|.. This splits the word into the "letters". Then, just sort the words by the splitted lists.

Answer 2

Vyxal a, 15 bytes

µ‛ch‛c~V‛ll‛l~V

Takes input as words separated by newlines, outputs a list.
Try it Online!

µ‛ch‛c~V‛ll‛l~V    # Full program
µ                  # Sort (implicit) input by key:
       V           # Replace...
 ‛ch               # `ch`...
    ‛c~            # with `c~`
              V    # Replace...
        ‛ll        # `ll`...
           ‛l~     # with `l~`

Answer 3

PowerShell, 46 44 51 50 bytes

$args|sort @{e={$_-replace'(?=ch|ll)(.).','$1Α'}}

The Α character is the Greek letter alpha which in comes after all Latin letters in PowerShell's default sort order (at least on my machine, I'm not sure if it's different in other locales). It's counted as 2 bytes in UTF8 encoding.

Example usage, assuming this string is saved in a file named es-sort.ps1:

> es-sort.ps1 'lzego' 'luego' 'llama'

luego
lzego
llama

Answer 4

Mathematica, 81 bytes

StringReplace[Sort@StringReplace[#,"ch"->"cZ","ll"->"lZ"],"cZ"->"ch","lZ"->"ll"]&

Same approach as TimmyD's answer.

Answer 5

05AB1E, 15 bytes

Σ„ch„c~:„ll„l~:

I/O as a list of strings.

Very straight-forward approach, but I'm unable to find anything shorter (thus far).

Try it online or verify all test cases.

Explanation:

Σ         # Sort the (implicit) input-list of strings by:
 „ch„c~:  #  Replace all "ch" with "c~"
 „ll„l~:  #  Replace all "ll" with "l~"
          #  (and then sort it by default lexicographical order)
          # (after which the sorted list is output implicitly)

Answer 6

Jelly, 16 15 12 bytes

eƬ“ch“ll”µƝÞ

Try it online!

Previous 12-byter sorted leading digraphs incorrectly, since the index took precedence over the actual character data.

           Þ    Sort the input by:
         µƝ     for each pair of adjacent characters as a list,
 Ƭ              apply while unique (collecting all results):
e               is it an element of
  “ch“ll”       ['ch', 'll']?

eƬ2ƤÞ“ch“ll” also works for 12 bytes, doing precisely the same thing.

Answer 7

Python 2, 128 116 bytes

lambda p:map(''.join,sorted([{'!':'ll','?':'ch'}.get(c,c)for c in w.replace('ll','!').replace('ch','?')]for w in p))

I still feel like there's definitely room for improvement here.

Answer 8

Javascript, 95 bytes

s=>s.map(a=>a.replace(/ll|ch/g,m=>m[0]+'~')).sort().map(a=>a.replace(/.~/g,m=>m>'d'?'ll':'ch'))

Answer 9

Perl, 40 bytes

Includes +1 for -p

Run with the list of words on STDIN:

perl -p spanisort.pl <<< "llama coche luego cocina caldo callar calma"

spanisort.pl

s/ll|ch|./\u$&/g;$_="\L@{[sort split]}"

Answer 10

Ruby, 42 bytes

->a{a.sort_by{_1.gsub(/ll|ch/){$&[0]+?|}}}

Attempt This Online!