def quickSort(arr, left=None, right=None):
 left = 0 if not isinstance(left,(int, float)) else left
 right = len(arr)-1 if not isinstance(right,(int, float)) else right
 if left < right:
 partitionIndex = partition(arr, left, right)
 quickSort(arr, left, partitionIndex-1)
 quickSort(arr, partitionIndex+1, right)
 return arr
def partition(arr, left, right):
 pivot = arr[right]
 i, j= left, right - 1
 while True:
 while i<=j and arr[i]<pivot:
 i+=1
 while i<=j and arr[j]>=pivot:
 j-=1
 if i<j:
 swap(arr, i, j)
 else:
 break
 swap(arr, i, right)
 return i
def swap(arr, i, j):
 arr[i], arr[j] = arr[j], arr[i]