Quick sort

 Quick Sort

def partition(arr,low,high): 

    i = ( low-1 )        

    pivot = arr[high]     

  

    for j in range(low , high):         

        if   arr[j] < pivot:      

            i+=1 

            arr[i],arr[j] = arr[j],arr[i] 

  

    arr[i+1],arr[high] = arr[high],arr[i+1] 

    return ( i+1 ) 

def quicksort(arr,low,high):

if low < high:

pi=partition(arr,low,high)

quicksort(arr,low,pi-1)

quicksort(arr,pi+1,high)

i=list(int(x) for x in input("enter elements separated by ,").split(","))

n=len(i)

for t in i:

print(t,end="\t")

quicksort(i,0,n-1)

print()

for t in i:

print(t,end="\t")