Sorting algorithms/Tree sort on a linked list: Difference between revisions
Content added Content deleted
(J: cave and do a "legit" [in-?] efficient binary search tree) |
m (→{{header|J}}) |
||
Line 12: | Line 12: | ||
=={{header|J}}== |
=={{header|J}}== |
||
What *is* a sentence in Finnegan's |
What *is* a sentence in Finnegan's Wake? Let's say that it's all the text leading up to a period, question mark or exclamation point if (and only if) the character is followed by a space or newline. (There are some practical difficulties here - this means, for example, that the first sentence of a chapter includes the chapter heading - but it's good enough for now.) |
||
There's also the issue of how do we want to sort the sentences? Let's say we'll sort them in ascii order without normalization of the text (since that is simplest). |
There's also the issue of how do we want to sort the sentences? Let's say we'll sort them in ascii order without normalization of the text (since that is simplest). |
||
Line 94: | Line 94: | ||
extract''</lang> |
extract''</lang> |
||
But the current url no |
But task's the current url for Finnegan's Wake no does not point at flat text and constructing such a thing would be a different task... |
||
=={{header|Kotlin}}== |
=={{header|Kotlin}}== |