How can I compare count of performing?

Question

import random
import time

def insertion_Sort(A):

    if len(A) == 1 :
        return A
    else :
        S = [A[0]]
        for i in range(1,len(A)):
            j = i-1
            while j >= 0:
                if A[i] > S[j]:
                    S.insert((j+1),A[i])
                    break
                else :
                    j = j-1
            if j==-1:
                    S.insert(0,A[i])
        return S




def quick_Sort(A):

    if not A:
        return []
    else:
        pivot = random.randint(0, len(A) - 1)
        pivot_index = A[pivot]
        L = quick_Sort([l for i,l in enumerate(A)
                           if l <= pivot_index and i != pivot])
        R = quick_Sort([r for r in A if r > pivot_index])
        return L + [pivot_index] + R





RN = [random.randrange(0,10000) for k in range(100)]

This is the code about quick_sort and insertion_sort.

I want to compare two things, insertion_sort(RN)'s count of performing and quick_sort(RN)'s count of performing.

How can I compare these things?

Possible duplicate of [How do I compare python functions in terms of performance?](http://stackoverflow.com/questions/7956834/how-do-i-compare-python-functions-in-terms-of-performance) — Chris_Rands, Apr 18 '17 at 11:21

score 0 · Answer 1 · answered Apr 18 '17 at 11:49

0

There is a python module called timeit which is exactly what you are looking for. You can use it as follows:

from timeit import timeit
print(timeit('insertion_Sort(params)','from __main__ import insertion_Sort',number=100))
print(timeit('quick_Sort(params)','from __main__ import quick_Sort',number=100))

And you replace params with the value of your parameter A and number=100 with the number of times you want it to be tested.

answered Apr 18 '17 at 11:49

Mr. Xcoder

4,719
5
26
44

Please read the comments under the question before writing an answer – Chris_Rands Apr 18 '17 at 11:52

How can I compare count of performing?

1 Answers1