Quicksort is a sorting algorithm invented by C
Timsort is a sorting algorithm invented by Tim Peters, designed to take advantage of partial ordering in data
"If that is so you might find that timsort runs faster than quicksort"
from question "Efficient way to merge key value lists from character arrays"
"If it is true then timsort will always take less comparison than quicksort because on real life data there is some pattern except data is truly random"
from question "How can Timsort beat the O(n log n) sorting bound in some cases?"
"I ve read that timsort is better than quicksort both in the best and the worst case although it uses a bit more memory"
from question "Why does .Net use Quicksort instead of Timsort?"
"You can take a look at timsort which for non completely random data performs better than quicksort they have the same asymptotic complexity but timsort has lower constants"
from question "How to optimize quicksort"
"Java s array .sort is from about java 6 actually timsort the fastest general purpose #sort out there much better than quicksort in many situations"
from question "Fast sort by date of huge file ArrayList"