input: Write a python function to sort an array using bubble sort and quick sort algorithms.
  assert bubbleSort([64, 34, 25, 12, 22, 11, 90]) == [11, 12, 22, 25, 34, 64, 90]
  assert bubbleSort([5, 2, 9, 1, 5, 6]) == [1, 2, 5, 5, 6, 9]
  assert quickSort([64, 34, 25, 12, 22, 11, 90], 0, 6) == [11, 12, 22, 25, 34, 64, 90]
  assert quickSort([5, 2, 9, 1, 5, 6], 0, 5) == [1, 2, 5, 5, 6, 9]
output: def bubbleSort(arr):
      n = len(arr)
      for i in range(n):
          for j in range(0, n-i-1):
              if arr[j] > arr[j+1]:
                  arr[j], arr[j+1] = arr[j+1], arr[j]
      return arr
  
  def quickSort(arr, low, high):
      if low < high:
          pi = partition(arr, low, high)
          quickSort(arr, low, pi-1)
          quickSort(arr, pi+1, high)
      return arr
  
  def partition(arr, low, high):
      pivot = arr[high]
      i = low - 1
      for j in range(low, high):
          if arr[j] < pivot:
              i += 1
              arr[i], arr[j] = arr[j], arr[i]
      arr[i+1], arr[high] = arr[high], arr[i+1]
      return i + 1