input: Write a python function to sort an array of numbers in descending order using the quicksort algorithm.
  assert quickSort([7, 5, 2, 4, 2, 9, 3, 8]) == [9, 8, 7, 5, 4, 3, 2, 2]
  assert quickSort([1, 2, 3, 4, 5]) == [5, 4, 3, 2, 1]
  assert quickSort([10, 10, -1, -2, 0]) == [10, 10, 0, -1, -2]
output: def quickSort(arr):
      if len(arr) <= 1:
          return arr
      pivot = arr[len(arr) // 2]
      left = [x for x in arr if x > pivot]
      middle = [x for x in arr if x == pivot]
      right = [x for x in arr if x < pivot]
      return quickSort(left) + middle + quickSort(right)