code: def QuickSort(l):
      size = len(l)
      if size > 1:
          # Get the lists of bigger and smaller items and final position of pivot
          idx = partition(l)
          l1 = []
          l2 = []
          for i in range(0, idx):
              l1.append(l[i])
          for i in range(idx, size):
              l2.append(l[i])
          # Recursively sort elements smaller than the pivot
          QuickSort(l1)
          # Recursively sort elements at least as big as the pivot
          QuickSort(l2)
          for i in range(0, len(l1)):
              l[i] = l1[i]
          for i in range(0, len(l2)):
              l[len(l1) + i] = l2[i]
      return l
  
label_desc: Use image node_id 3 for calling a global function with example usage: QuickSort(l) and returns: l