User talk:Gerard Schildberger: Difference between revisions

(→‎Sort algorithms: new section)
Line 840:
You can see where where I made the assumption that &nbsp; <big>'''├á'''</big> &nbsp; was the ASCII character &nbsp; <big>'''á'''</big> &nbsp; &nbsp; &nbsp; (instead of the correct character &nbsp; <big>'''à'''</big>). &nbsp; I'll will correct the translation within my REXX program and also the program's output. &nbsp; (Pardon my French, but that was a bugger to track down). &nbsp; -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 16:55, 10 December 2017 (UTC)
:I see. If you open a file encoded in UTF-8 in a editor that tries to interpret it as another codepage, you will get that kind of problem. For instance, "Déjà" is printed as "D├⌐j├á vu" in CP437 (a DOS codepage, that you seem to be using here), or "DéjÃ" in ISO-8859-1 (Latin-1). That's because UTF-8 encodes Unicode characters as multibyte sequences. It would be possible to read a UTF-8 as binary and do the translation "by hand", but there are programs able to do the translation for you. On Windows, the Notepad++ text editor can do this. [[User:Eoraptor|Eoraptor]] ([[User talk:Eoraptor|talk]]) 10:18, 11 December 2017 (UTC)
 
== Sort algorithms ==
 
BTW, I'm not sure I would list lexicographical sorting in with sorting algorithms. It isn't really an algorithm, it's an ordering. (It doesn't specify '''how''' to sort, only the '''order''' the items should end up in.) --[[User:Thundergnat|Thundergnat]] ([[User talk:Thundergnat|talk]]) 11:25, 30 July 2018 (UTC)
10,327

edits