input: Write a python function to sort a list of dictionaries by a specified key using quicksort.
  assert quickSort([{"name": "John", "address": "123 Main Street"}, {"name": "Adam", "address": "456 First Avenue"}, {"name": "Mike", "address": "789 Street Street"}], "name") == [{"name": "Adam", "address": "456 First Avenue"}, {"name": "John", "address": "123 Main Street"}, {"name": "Mike", "address": "789 Street Street"}]
  assert quickSort([{"name": "Zara", "address": "123 Main Street"}, {"name": "Adam", "address": "456 First Avenue"}, {"name": "Eva", "address": "789 Street Street"}], "name") == [{"name": "Adam", "address": "456 First Avenue"}, {"name": "Eva", "address": "789 Street Street"}, {"name": "Zara", "address": "123 Main Street"}]
  assert quickSort([{"name": "Eva", "address": "123 Main Street"}, {"name": "Eva", "address": "456 First Avenue"}, {"name": "Adam", "address": "789 Street Street"}], "name") == [{"name": "Adam", "address": "789 Street Street"}, {"name": "Eva", "address": "123 Main Street"}, {"name": "Eva", "address": "456 First Avenue"}]
output: def quickSort(arr, key):
      if len(arr) <= 1:
          return arr
      pivot = arr[len(arr) // 2]
      left = [x for x in arr if x[key] < pivot[key]]
      middle = [x for x in arr if x[key] == pivot[key]]
      right = [x for x in arr if x[key] > pivot[key]]
      return quickSort(left, key) + middle + quickSort(right, key)