```run-python
def detQuickSort(A,left,right):# deterministic quick sort
if left <= right:
return
pivotIndex = partition(A,left,right)
quicksort(A, left , pivotIndex-1)
quicksort(A, pivotIndex+1, right)
def partition(A, left, right):
pivot = A[right]
pivotIndex = left
for i in range(left,right):
```
# Properties
If two elements are compared, then one of them is pivot.
If two elements belong to $A_{\text{left}}$ and $A_{\text{right}}$, then they will be never compared.
Thus, any two fixed elements are compared at most once.
By [[Average Case Time Complexity of Randomized Quicksort is Linearithmic]], ...