I want to sort strings (text) in a software project of mine. I'm planning to do this in the lexically best way.
My My set of possible characters consist of the full alphabet (a-za–z and A-ZA–Z) and of the typical Latin 1 Umlauts, like "ÄÖÜäöüß"Ä, ö, ß, and also characters from other Latin 1 languages like: "àáâã"... à, á, â, ã. (It’s technically impossible to order the data by expanding characters like Ä to Ae.)
How would one sort those characters so that also humans could look them up fast?
For instance one would seek for Ä after A (I guess). And for é after e.
In which order would "àáâãä" be sorted in between a and b? Is there some kind of ISO standard defining such things? How would those characters be arranged?
Sadly it's technically impossible to order the data by expanding characters like Ä to Ae.
- Would one look for Ä after A (I guess). And for é after e?
- In which order would à, á, â, ã, and ä be sorted in between a and b?
- Is there some kind of ISO standard defining such things? How would those characters be arranged?