Sorting algorithms/Tree sort on a linked list: Difference between revisions

m
(J: cave and do a "legit" [in-?] efficient binary search tree)
Line 12:
=={{header|J}}==
 
What *is* a sentence in Finnegan's wakeWake? 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).
Line 94:
extract''</lang>
 
But task's the current url for Finnegan's Wake no longerdoes pointsnot point at flat text for finnegan's wake and constructing such a thing would be a different task...
 
=={{header|Kotlin}}==
6,962

edits