I think it is just O(n)?? If I can assume that the functions always do simple additions and multiplications meaning they are O(1), then the function chainer will execute n of these.

So it should just be O(n), regardless of the recursive nature of this kata.

Watch out for the arguments. The count argument could be way beyond the length of the array, it could even reach Infinity.

Ranks cant be changeed

I am agree with gxcad. You need to think how to solve it with simple way

Not sure how it could pass on CW if it was 40s on your machine, but feel free to suggest improvements :)

Can you give a test and a supposedly "wrong" solution that doesn't pass your test?

The trolls were feeding on it

Please which?

I'm assuming you know what a prime number and a factorial is. They want you take a number (n) and return its prime factors. So the prime factors of 6! are the 2222 * 3 * 3 * 5. Prime factors of 10 are 52.