Which algorithm is quicker, insertion sort or quicksort?

I'm trying to time both algorithms to see which is faster for different size arrays of numbers. Which is the faster?