Interesting. If I understand correctly, this is a simplified sieve of Eratosthenes: instead of marking multiples of primes, it marks multiples of numbers that might be prime. Right? I'm not sure...

Amazing!

:D

brillient.

This code reminds me of the proverb, "No pain, no gain."

Fucking Genius)

Thanks.

But uncorrect in sit a1 = [2, 2, 3]; a2 = [1, 4, 16]

Lol, this sol more faster then another sols with "sorted()". My respect

No problem :)

Ok dude, my bad

arr should be a list of unique integers.

The one you tested the function whith, namely [3, 5, 3, 7, 4] doesn't match this requirement, since 3 is repeated twice, hence the result.

https://cdn.discordapp.com/attachments/756080989771661333/769271028668301312/unknown.png

Didn't passed test