Talk:Sorting algorithms/Cycle sort: Difference between revisions
Content added Content deleted
m (→4 REXXen: added some comments (even comments about comments).) |
m (→number of writes: "struck-out" my bumbling questions.) |
||
| Line 1: | Line 1: | ||
==number of ''writes''== |
==number of ''writes''== |
||
<strike> |
|||
Am I missing something or is the sample algorithm (on the Wiki article '''Cycle sort''') incorrect in regards to the number of ''item writes'' (when placing items in the array)? |
Am I missing something or is the sample algorithm (on the Wiki article '''Cycle sort''') incorrect in regards to the number of ''item writes'' (when placing items in the array)? |
||
| Line 6: | Line 7: | ||
I only mention it as it appears one of the benefits of a ''cycle sort'' is the low number of writes being used during the cycle sort process. -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 22:35, 13 June 2014 (UTC) |
I only mention it as it appears one of the benefits of a ''cycle sort'' is the low number of writes being used during the cycle sort process. -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 22:35, 13 June 2014 (UTC) |
||
</strike> |
|||
----- |
----- |
||
Nevermind, I see the algorithm was only counting writes to the original array. -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 22:37, 13 June 2014 (UTC) |
Nevermind, I see the algorithm was only counting writes to the original array. -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 22:37, 13 June 2014 (UTC) |
||
==4 REXXen== |
==4 REXXen== |
||