pseudo code for quick sort: def quickSort(nums): if start < end: pIndex = partition(nums, start, end) quickSort(start, pIndex - 1) quickSort(pIndex + 1, end) def partition(nums, start, end): pivot = nums[end] pIndex = start for i in range(start, end): if nums[i] <= pivot: swap(nums[i], pivot) pIndex += 1 swap(pivot, nums[pIndex]) return pIndex