Python Partial sorting algorithm (user provided)

Bubble Sort

def bubble (x,n):
"This function orders the original items X

    x is list,n is the length of x "
    for i in range (n):
         for j in range (n-1):
             IF X[J] >X[J+1]:
                 T = X[J]
                 X[J]= X[J+1]
                 x[j+1] = t

//  insert sort
Def insert (x,n):
      i = 1
     while i<n-1:
          key = x[i]
          j = i-1
         while j>=0 and &NBSP;KEY<X[J]:
             x[j+1]= &NBSP;X[J]
             j -= 1
         x[j+1] = key
          i += 1

Select Sort
def select (x,n):
For I in Range (n-1):
Key = I
For j in Range (I+1,n):
If X[J] < X[key]:
Key = J
If key!=i:
t = x[i]
X[i] = X[key]
X[key] = t

//Quick Sort
def partition (X,low,high):
Key = X[low]
While LowWhile LowHigh-= 1
If low < high:
x[low]= X[high]
Low + = 1
While low Low + = 1
If low < high:
X[high] = X[low]
High-= 1
X[low] = key
return low
def quick (X,low,high):
If low < high:
p = partition (X,low,high)
Quick (x,low,p-1)
Quick (X,p+1,high)

Python Partial sorting algorithm (user provided)