Revision as of 11:54, 30 April 2013 edit Ruud Koot (talk \| contribs) 31,416 edits →Is there a name for this sort algorithm?: re ← Previous edit		Revision as of 04:01, 1 May 2013 edit undo Rcgldr (talk \| contribs) Extended confirmed users 2,505 edits →Is there a name for this sort algorithm? Next edit →
Line 562: *One interesting aspect of this small loop is that if you consider sorting I by the values of A as a permutation, then this loop "unpermutes" I, while at the same time it "permutes" A. This occurs because the values in the locations swapped in I are used as indexes for the locations swapped in A. [[User:Rcgldr\|Rcgldr]] ([[User talk:Rcgldr\|talk]]) 23:04, 29 April 2013 (UTC) ::So the main enhancement of this algorithm is the part that sorts the array A[] while performing the special cycle sort on I[]. I searched again but wasn't able to to fing any references citing that special cycle sort could be used for this purpose. [[User:Rcgldr\|Rcgldr]] ([[User talk:Rcgldr\|talk]]) 04:01, 1 May 2013 (UTC)

Talk:Sorting algorithm: Difference between revisions