Switched to std::sort for sorting the potential ray intersections.

It's only barely slower than the counting sort, and has other benefits,
such as:
- Takes no additional RAM.
- Doesn't need to know the range of possible values.

I'm still leaving the counting sort code in, just in case.  But I suspect
I'll stick with std::sort.