| This is the talk page for discussing improvements to the Multi-key quicksort article. This is not a forum for general discussion of the article's subject. |
Article policies
|
| Find sources: Google (books · news · scholar · free images · WP refs) · FENS · JSTOR · TWL |
 | This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||||||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||||||||||||||
Slice syntax
edit@CiaPan: I'm fine with your changing the slice syntax to "not include the same item in two parts", but I actually intended it the right index to be exclusive (as it is in Python and Cilk). I now notice that in Haskell, from which I stole the actual notation, .. denotes an inclusive range:
Prelude> [0..5]
[0,1,2,3,4,5]
I do think, though, that we need a better, unambiguous notation. Do you think readers would understand a kind of half-open notation, viz.
a[0:i) a[i:j) a[j:length(a))
? QVVERTYVS (hm?) 12:38, 9 April 2015 (UTC)
- @Qwertyus: Do as you wish. :) I know the Pascal notation where
i .. jwas inclusive, but I understand it is not widely used. Possibly some note about the expression meaning would be useful, possibly in the description after the code. If you think your notation is clear enough, just restore it, I'm not going to make a third revert anyway.--CiaPan (talk) 13:57, 9 April 2015 (UTC)
- Changed it to my proposed syntax, and amended the footnote. QVVERTYVS (hm?) 19:52, 9 April 2015 (UTC)