Talk:Amicable pairs: Difference between revisions
Content added Content deleted
m (→amicable pairs, out of order: increased the size of the (output) table of amicable pairs.) |
|||
| Line 67: | Line 67: | ||
:: Actually, the output isn't sorted at all, except in the sense that, when looking for the amicable pairs that were found, it finds the lowest number for the 2nd number in the pair. This is just an artifact of how the search was performed. -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 21:01, 5 October 2015 (UTC) |
:: Actually, the output isn't sorted at all, except in the sense that, when looking for the amicable pairs that were found, it finds the lowest number for the 2nd number in the pair. This is just an artifact of how the search was performed. -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 21:01, 5 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) |
|||