Anonymous user
Talk:Primes - allocate descendants to their ancestors: Difference between revisions
Talk:Primes - allocate descendants to their ancestors (view source)
Revision as of 09:59, 25 February 2015
, 9 years ago→Task comments
Line 8:
# The task mentions comparing algorithms but does not explain the different algorithms in pseudocode or a textual description.
--[[User:Paddy3118|Paddy3118]] ([[User talk:Paddy3118|talk]]) 17:16, 24 February 2015 (UTC)
:Hi,
# 'The list layout' showed a partial ouput for parent [46]. I've changed it to the full results for parent [46].
# Yes, the output is too big to be posted (5.079 KB), that's why, I give the total of all descendants.
# 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.
# I didn't know one author/one language. Where can I find the rules ?
# 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".
| |||