Peter Alexander: > It's used a fair amount in geometry. I know the Kirkpatrick-Seidel > algorithm uses it and I've seen some Delaunay triangulation > implementations use it. I'm pretty sure there's other geometrical > applications for it as well.
Thank you for your explanations. > (I just Googled for "quicksort pseudocode" and sure enough, all of the > top 10 entries that actually contained code defined a partition function > that does what std.algorithm.partition does). Yes, it's named partition in my implementations of Quicksort too :-) So it's better to find a different name for the other one. Bye, bearophile
