Adapted from my Haskell solution.

I'm new to Haskell and functional programming overall, I opted to keep the code more readable than consise

Time complexity: O(n)

Auxiliary space: O(1)

?????

.

Can this solution be considered O(1), since the largest number of iterations that can happen in a single for loop is limited to 15?

Alien-level code

Very interesting kata, 10/10!

I'm sorry for this :(

Fixed, please review.

CPU's have been real quiet since this dropped

I cannot resist the urge to use structs

I failed to handle that 3 specific tests :(

C test cases expect the result to be sorted in DESCENDING order, the opposite of the kata description.

Time complexity: O(n.m)