akshaydk

def quick_sort(A,low,high):
    if low<high:
        i=low+1
        pivot=low
        print 'pivot=', A[pivot]
        left=right=count=0
        for j in range(low+1,high):
            # print 'i=',i
           # print 'j=',j
            count+=1