<s>[INST] Write a python code to implement quick sort [/INST] ```py
def partition(array, low, high):
  pivot = array[high]
  i = low - 1
  for j in range(low, high):
    if array[j] <= pivot:
      i = i + 1
      (array[i], array[j]) = (array[j], array[i])
  (array[i + 1], array[high]) = (array[high], array[i + 1])
  return i + 1

def quickSort(array, low, high):
  if low < high:
    pi = partition(array, low, high)
    quickSort(array, low, pi - 1)
    quickSort(array, pi + 1, high)
```</s>\ <s>[INST] It looks good. Thank you for writing that code. [/INST] Your welcome! Is there anything I could help you with?</s>