Talk:Primes - allocate descendants to their ancestors

Task comments

Hi, on reading the task I thought that:

1. The language examples show no output.
2. If they did show output, would it be too long?
3. The task shows time comparisons which is difficult to make comparable.
4. The task shows time comparisons between different languages - we normally write tasks in which solutions only need authors to use one language.
5. The task mentions comparing algorithms but does not explain the different algorithms in pseudocode or a textual description.

--Paddy3118 (talk) 17:16, 24 February 2015 (UTC)

Hi,

1. 'The list layout' showed a partial ouput for parent [46]. I've changed it to the full results for parent [46].
2. Yes, the output is too big to be posted (5.079 KB), that's why, I give the total of all descendants.
3. I did put some time comparisons, because I was so surprised, from a few seconds in C to almost 10 minutes required by the "Visual Basic .NET with collection". This is my first 'Visual Basic .NET' program, I probably did something wrong, because the program runs in 20 seconds, now. I deleted the time comparisons.
4. I didn't know one author/one language. Where can I find the rules ?
5. I already put a textual description : "This solution could be compared to the solution that would use the decomposition into primes for all the numbers between 5 and 3^33".

--Old man (talk) 09:00, 25 February 2015 (UTC)