quick_sort_rev

#!/usr/bin/python3
import random
lst = random.sample(range(1,100),10)
print("Imput list:{}".format(lst))
def split(lst, start, end):
 #Splits list into two parts.
 i = start - 1
 spliter = lst[end]
    for j in range(start, end):
    if lst[j] <= spliter:
        i = i + 1
        lst[i], lst[j] = lst[j], lst[i]
        lst[i+1], st[end] = lst[end], lst[i+1]
        return i + 1
def quick_sort(lst, start, end)
  """sorts list using quick sort algoritm.
  This is recursive
  """
  if start < end:
    s = split(lst, start, end)
    quick_sort(lst, start, S - 1)
    quick_sort(lst, s + 1, end)

    quick_sort(lst, 0, len(lst - 1))

     """ reversive list in sort"""

      lst.reverse()

    print("Output list {}". format(lst))