Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!utgpu!water!watmath!clyde!rutgers!seismo!mcvax!enea!ttds!draken!sics!dan
From: dan@sics.UUCP
Newsgroups: comp.std.internat
Subject: Re: Character representation
Message-ID: <1478@sics.se>
Date: Tue, 18-Aug-87 14:56:23 EDT
Article-I.D.: sics.1478
Posted: Tue Aug 18 14:56:23 1987
Date-Received: Sat, 22-Aug-87 09:04:31 EDT
References: <2171@enea.UUCP> <176@hobbes.UUCP>
Reply-To: dan@sics.se (Dan Sahlin)
Organization: SICS, Swedish Inst. of Computer Science
Lines: 20

In article <176@hobbes.UUCP> root@hobbes.UUCP (John Plocher) writes:
>Theory:
>	  The correct way of sorting (or comparing) strings which contain
>	accented characters is to first compare the strings with all accents
>	stripped. If the two strings are the same, then and only then are the
>	accents used.  This second comparison involves only the accents.
>	You can think of this as comparing the two strings with all the letters
>	stripped.

Sorry, that is not the correct way to sort in Swedish.
The three letters a(with a ring), a(with two dots), o(with two dots)
always come at the end of the alphabet, after z.
Traditionally v and w are also considered the same letter in Swedish.

There is unfortunately no universal way to sort things alphabetically,
each language has its own ways. This fact has for instance been incorporated
into the Macintosh system, where there sorting depends on the national
version.

	Dan Sahlin              (dan@sics.uucp)