how_many = 100000
sorting_func = sort #this shuffles input
#sorting_func = quick_sort
tries = 10

accumulated_time = {'Sorted': 0,
                    'Reverse': 0,
                    'Random': 0,
                    'A lot of equal keys': 0,
                    'Same keys': 0}
for i in range(tries):
    data_sets = {'Sorted': [x for x in range(how_many)],
                 'Reverse': list(reversed([x for x in range(how_many)])),
                 'Random': [random.randint(0, how_many) for x in range(how_many)],
                 'A lot of equal keys': [x if x % 2 else 0 for x in range(how_many)],
                 'Same keys': [1] * how_many}
    for what, set in data_sets.items():
        start = time.clock()
        sorting_func(set)
        end = time.clock()
        accumulated_time[what] += (end - start)

print("Average time:")
for what, total_time in accumulated_time.items():
    print(what + ": " + str(total_time/tries))

Average time:
A lot of equal keys: 0.30944705735259076
Reverse: 0.5213236423849711
Random: 0.5092556249405173
Sorted: 0.5258773700452282
Same keys: 0.09532146027318696

Average time:
Same keys: 0.016281707645539805
Random: 0.40859697925563115