Pertanyaan yang diberi tag quicksort

83
Quicksort Partitioning: Hoare vs Lomuto

Ada dua metode partisi quicksort yang disebutkan dalam Cormen: Hoare-Partition(A, p, r) x = A[p] i = p - 1 j = r + 1 while true repeat j = j - 1 until A[j] <= x repeat i = i + 1 until A[i] >= x if i < j swap( A[i], A[j] ) else return j dan: Lomuto-Partition(A, p, r) x =...