quicksort

def quicksort(a,lb,ub):
 if(lb<ub):
  loc=partition(a,lb,ub)
  quicksort(a,lb,loc-1)
  quicksort(a,loc+1,ub)
 return(a)

def partition(a,lb,ub):
 start=lb
 end=ub
 pivot=a[lb]
 while(start<end):
  while(a[start]<=pivot):
   start+=1
  while(a[end]>pivot):
   end-=1
  if(start<end):
   temp=a[start]
   a[start]=a[end]
   a[end]=temp
 temp=a[lb]
 a[lb]=a[end]
 a[end]=temp
 loc=end
 
 return loc



a=[10,7,6,3,9,12,13,45]
k=quicksort(a,0,7)
print(k)