Nice!Tried this but got some weird error when trying to sort ages. Definetely my fault, but nice to see it could be done!

sweet

Damn, this is clever

Ah, I was clever, but not clever enough.

oh mine!!! i had this intentionpainful

what the fuk

crispy one , bravo

Not sure what are you referring to as the "loop". The argument passed in is a list so there is no need to transform it.

But you didn't transform the loop into a list.

I know it does. It is easy to fix it but guess what, I didn't CARE.
Also dividing integers by 2 is FAST and len() is also FAST.

This implementation calls len(s) FIVE times when it only needs to call it once. It also divides len(s) by 2 FIVE times when it only needs to calculate it once.

This is O(n*log(n)) instead of O(n)...