Изменения

if l < r then q = Partition(A, l, r) Quicksort(A, l, q) Quicksort(A, q, r)

x = A[l] i = l j = r while true do while a[i] > x do i = i + 1 while A[j] < x do j = j - 1 if i < j then поменять A[i] и A[j] else return j