Quick Sort in DSA using Python

Program 1

#Program for Quick Sort
import os
def quick_sort(mylist,l,h):  # l=0  h=9
    low=l    # low=0
    high=h  # high=9
    key=mylist[(low+high)//2]  # Pivot element
    while(low<=high):
         while(key>mylist[low]):
                 low=low+1
         while(key<mylist[high]):                  
                    high=high-1
         if(low<=high):
               mylist[low],mylist[high]=mylist[high],mylist[low]
               low=low+1
               high=high-1
    if(l<=high):
          quick_sort(mylist,l,high)  # recursion
    if(low<h):
          quick_sort(mylist,low,h)  # recursion
                                       

#Main Method
os.system('cls')
mylist=[]
n=int(input("Enter the limit"))  # Limit
print("Enter an element")   # No of element
for i in range(n):
    x=int(input())
    mylist.append(x)
low=0   
high=n-1 
quick_sort(mylist,low,high)  # 3 Argument 

print("-------------Sorted element---------")
for i in range(n):
    print(mylist[i])