title: get a reversed sorted quickSort (descending order)
body: <p>I have a problem with my code that hopefully someone here can solve. The code works with the quickSort algorithm but I want this specific part of the code to give me a reversed sorted quickSort list, so a list in a descending order. Can someone here help me? </p>
  
  <pre><code>def quickSort(L, ascending = True):
      print('Quicksort, Parameter L:')
      print(L)
      if len(L) &lt;= 1: return L
      smaller, equal, larger = [],[],[]
      pivot = L[randint(0,len(L)-1)]
  
      for x in L:
          if x &lt; pivot: smaller.append(x)
          elif x == pivot: equal.append(x)
          else: larger.append(x)
  
      print('result: ', quickSort(smaller)+equal+quickSort(larger))
      return quickSort(smaller)+equal+quickSort(larger)
  
  
  l1 = list([3, 2, -1, 9, 17, 4, 1, 0])
  
  l2 = list([3.14159 , 1./127, 2.718 , 1.618 , -23., 3.14159]) 
  
  l1 = mergeSort(l1)
  
  l2 = quickSort(l2,False)
  </code></pre>