def METHOD_NAME(n, show_list):
    """Create a random list and measure the performance of quicksort on it."""
    sample_list = range(n)  # create a sorted list of n keys
    # commenting out the line below overflows the recursion limit
    # when the list is large
    shuffle(sample_list)  # shuffle them
    print "\nQuick sorting", n, "keys"
    if show_list:
        print "Test list is", sample_list
    start = time.clock()
    key_comparisons_made = quick_sort_count(sample_list)
    end = time.clock()
    if show_list:
        print "Quicksort output is", sample_list
    result = "For quicksort of {} items, {} comparisons of keys were used"
    time_taken = "Time taken: {:.4f} milliseconds elapsed"
    print(result.format(n, key_comparisons_made))
    print(time_taken.format((end - start) * 1000))