Quick sort algorithm in Python

quicksort_algo.py

def quicksort(templist):
  if len(templist)<=1:
    return templist
  pivot=templist[0]
  left,right=[],[]
  
  for data in templist:
    if data<pivot:
      left.append(data)
    elif data>pivot:
      right.append(data)

  left=quicksort(left)
  right=quicksort(right)
  # uncomment below line to see how data changes.
  #print(" ".join((list(map(str,left))+[str(pivot)]+list(map(str,right)))))
  return left+[pivot]+right
  
print(quicksort([5,8,1,3,7,9,2]))

'''take a pivot. In the above program element in first index is considered pivot.
bring items less than pivot to left.
now items greater than pivot are on right.
recurse until list size=1, base condition here: return
left+pivot+right is at the core of quicksort.'''