Talk:Amicable pairs: Difference between revisions
Content added Content deleted
(→amicable pairs, out of order: added some comments.) |
|||
| Line 69: | Line 69: | ||
::: I think you mean that there was no post-process sorting algorithm used here. In other words, I think are talking about the structure of the algorithm rather than the structure of the data. Nevertheless, a statement such as <code>Do x=1 To 20000</code> generates values for x in a sorted order... --[[User:Rdm|Rdm]] ([[User talk:Rdm|talk]]) 01:03, 7 October 2015 (UTC) |
::: I think you mean that there was no post-process sorting algorithm used here. In other words, I think are talking about the structure of the algorithm rather than the structure of the data. Nevertheless, a statement such as <code>Do x=1 To 20000</code> generates values for x in a sorted order... --[[User:Rdm|Rdm]] ([[User talk:Rdm|talk]]) 01:03, 7 October 2015 (UTC) |
||
:::: The '''do''' loop mentioned above (as used in the REXX program), like you said, generates values of '''x''' in a sorted order, but does not do any sorting of data (amicable numbers). However, what the '''do''' loop does, in reality, is generating values for '''x''' in numerical order, where '''y''' is coupled to the value of '''x''' (where '''x''' is the first part of the amicable pair, and '''y''' is the second part). However, the '''sigma''' of '''x''' most likely isn't known at this time, so the value of '''x''' isn't displayed until the '''sigma''' of '''y''' is computed, thus, the values of '''x''' are shown out of order, even though one would think that the values of '''x''' should appear in numerical order. -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 01:58, 7 October 2015 (UTC) |
|||
<!-- Like baseball, the runner on 1st can't run to 2nd until the runner on 2nd advances to 3rd. Apologies for the similarity to the Abbot and Costello routine. --!> |
|||