Talk:Sorting algorithms/Quicksort: Difference between revisions

Content added Content deleted

Inline

Revision as of 17:26, 26 June 2009 (view source) rosettacode>Mwn3d m (→‎Fortran-90 code ... pivot choice can cause it to go O(N^2)) ← Older edit		Revision as of 18:44, 26 June 2009 (view source) rosettacode>ShinTakezou (→‎Fortran-90 code ... pivot choice can cause it to go O(N^2)) Newer edit →
Line 39:		Line 39:

	Note that the problem isn't that it's a bad pivot choice. It's that the comments say it's a good pivot choice. Other examples have bad pivot choices (Java just picks the first element), but the task doesn't require a good pivot choice. --[[User:Mwn3d\|Mwn3d]] 17:25, 26 June 2009 (UTC)		Note that the problem isn't that it's a bad pivot choice. It's that the comments say it's a good pivot choice. Other examples have bad pivot choices (Java just picks the first element), but the task doesn't require a good pivot choice. --[[User:Mwn3d\|Mwn3d]] 17:25, 26 June 2009 (UTC)

			: The comments say just it's a good pivot choice for already sorted data or for reverse sorted data; I haven't checked it, but I can believe it, as I can believe it's not a so good choice for "symmetric triangle" distribution. --[[User:ShinTakezou\|ShinTakezou]] 18:44, 26 June 2009 (UTC)