@adamisom, what's not explained very well here is that you're trying to move from the current population to a new population made up of modified copies from the original one. That's why you're duplicating them (because you may wish to select a member more than once in its original state), and why you need to iterate this step multiple times (to build up the new population to the right size).
Hope that helps, this kata really did feel like fumbling around in the dark for a lot of it.
I would assume that it would be the folks around here that appreciate recursion.
The time to process is probably the fastest of all solutions.
My solution as example had many many more iterations and is much slower.
I think it is a beautiful recursive work of art. I'm sure im not the only one...
This comment is hidden because it contains spoiler information about the solution
@adamisom, what's not explained very well here is that you're trying to move from the current population to a new population made up of modified copies from the original one. That's why you're duplicating them (because you may wish to select a member more than once in its original state), and why you need to iterate this step multiple times (to build up the new population to the right size).
Hope that helps, this kata really did feel like fumbling around in the dark for a lot of it.
I would assume that it would be the folks around here that appreciate recursion.
The time to process is probably the fastest of all solutions.
My solution as example had many many more iterations and is much slower.
I think it is a beautiful recursive work of art. I'm sure im not the only one...
LOL folks that probably equate least lines to "better practice". It is clever for sure though :]
m is the original input value, in which language do you see it being negative?