I have a quick sort algorithm and it passes all the test cases. I need to calculate how many comparisons in this algorithm. At the func of def quick_sort(a) I need to return count-comparison. I am adding my algorithm below please do not change it, just add the count variable to count how many comparisons in my function and return count at the quick_sort(a) function. ty!

if len(a) <= 1: return a return part(a,0,len(a)-1)

def quick_sort(a): _quick_sort(a) return count

def part(a,start,end): pivot = a[end] border = start if start < end: for i in range(start,end+1): if a[i] <= pivot: a[border], a[i] = a[i], a[border] if i != end: border += 1 part(a,start,border-1) part(a,border+1,end) return a