Anonymous user
Talk:Parallel calculations: Difference between revisions
no edit summary
(→Python example?: Still seems OK to me, w.r.t. the task description?) |
No edit summary |
||
Line 9:
:: Hi Abu, the lowest factors of each of the numbers ''are'' returned to the main process where the minimum is then found. A full prime factorization of the numbers seems wasteful given the task description and that the smallest prime factor is computed first.
:: Should you the modify the task to state explicitely that all prime factors should be returned or should you keep this aspect un-specified? I, (of course), think that the current task keeps the focus on the parallelism and that specifying that all factors should be computed when only the smallest is needed goes against your need for speed. --[[User:Paddy3118|Paddy3118]] 10:28, 21 December 2010 (UTC)
:: Hi Paddy, I don't want to be picky, but task already does that. It says "... and return that number and its prime factors". The two solutions so far seem to do that, and I didn't think it would be a problem to change the Python version accordingly. It isn't even necessary to write a new function, just call the solution in the [[Prime decomposition]] task. --[[User:Abu|Abu]] 10:46, 21 December 2010 (UTC)
| |||