So that's Ruby's sorting function... It doesn't even look like it's
checking the size of the array before sorting. Does this mean, quicksort
is used no matter what the size of the array. So even when I'm sorting
10 elements, it's using quicksort?

Ruby's quicksort function is 207 lines. Timsort is 1301 lines of C.
http://code.google.com/p/timsort/source/browse/trunk/timsort.c

Shouldn't the Ruby community feel ashamed that Python has a more
optimized sorting function?

-- 
Posted via http://www.ruby-forum.com/.