Timsort is a sorting algorithm that is efficient for real-world data
Are there benchmarks available for this kind of algorithm? If you come up with a fast sorting algorithm how would you go about making a case it's faster than currently used ones on real world data?