DatenstrukturenUndAlgorithmen_Vo_20071122

# DatenstrukturenUndAlgorithmen_Vo_20071122 -...

This preview shows pages 1–9. Sign up to view the full content.

RAND_PARTITION (A,l,r) idx = RANDOM(l,r) VERTAUSCHE(A[i],A[idx]) p = A[l] j = l-1 k = r+1 loop repeat j=j+1 until A[j] => p repeat k=k-1 until A[k] =< p if j < k then

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: vertausche (A[j],A[k]) else return k QUICKSORT(A,l,r) if l < r then k=PARTITION (A,l,r) QUICKSORT(A,l,k) QUICKSORT(A,k+1,r)...
View Full Document

{[ snackBarMessage ]}

### Page1 / 9

DatenstrukturenUndAlgorithmen_Vo_20071122 -...

This preview shows document pages 1 - 9. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online