Timeline for a funky interleaved sorting problem
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 4, 2016 at 15:30 | comment | added | Erik Eidt | Yes, one needs to be able to define it in human language. In other words, it needs a domain-specific definition. With that, it ought to be trivial to code up. Defining the domain specific definition by giving a few examples is not very rigorous. So, I'd assert we can only point in the right direction here, as the domain definition of collation ordering is incomplete in the question. | |
| May 4, 2016 at 15:27 | comment | added | Marnen Laibow-Koser | ...and there's the rub. The problem (IMHO) is largely that writing a comparator function for this is rather difficult. | |
| May 4, 2016 at 15:25 | history | answered | Erik Eidt | CC BY-SA 3.0 |