Works fine for me now. Thank you very much for the quick respond and fix.

I am trying to solve this cata in C. What does -nan mean. My solution does not work for navg = -nan.

I love this solution. It is like a puzzle that needs to be solved. Clever.XD

Thanks again for the insightful explanation. It is also very interesting to see how qsort is implemented in glibc.

Nice. That's why you should consider to learn some math to become a better programmer. ;)

Thank you very much for the detailed answer.

i don't get it. XD

Clever use of qsort. I asked myself how to sort the ints like this with a single compare function. Thank you for the example. Maybe returning *a -*b or *b - *a could produce some overflows.

This kata made me wonder, what would be the best way to remove the duplicates in an array of ints in C. I thought about something like a hashtable but decided to simply sort the ints and remove the duplicates afterwards because that was much simpler to implement for me. What do you think is the most efficient way to build a set of ints in this case?

lol. I tried strcmp(card, &deck[i]) the whole time and did not get what I was doing wrong. Solid Solution. :)

I like the usage of definitions in this solution. A good way to make the function more self explanatory.

beautiful. :)