QuickSort InPlace Python

quicksort.py

items = [2,5,6,7,8,5,0,1,9,3,4]
#items = [3, 4, 5, 2 ,1]
 
def quick_sort(items,first,last):
    """ Implementation of in-place quicksort """
    if(first < last):
      pivot, left, right = first, first, last
      
 
      while(left<right):
        while((left < last) and (items[left] <= items[pivot]) ):
          left +=1
        while((right > first) and (items[right] > items[pivot]) ):
          right-=1
        if(left<right):
          items[left] , items[right] = items[right] , items[left]
          left+=1
          right-=1
    
     
        items[pivot], items[right] = items[right],items[pivot]
        quick_sort(items, first , right-1)
        quick_sort(items, right+1, last)
 
 
 
print ('----------------')
print ('start %s' %items)
print ('----------------')
quick_sort(items,0,10)
print ('----------------')
print ('end %s' %items)
print ('----------------')