DatenstrukturenUndAlgorithmen_Vo_20071115

# DatenstrukturenUndAlgorithmen_Vo_20071115 - p = A[i j=l-1...

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

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

View Full Document
MAXIMUM (A) return A[1] ENTFERNE_MAX (A) A[1] = A[n] n=n-1 Verhalde (A,1) EINFUEGEN (A,x) n = n+1, A[n]=x, i=n While i > 1 and A[i]>A[Vater(i)] do Vertausche (A[i],A[Vater(i)]) i = Vater(i) www.cosc.canterbury.ac.nz/mukundan/dsal/MinHeapAppl.html HEAP_SORT(A) for i = n downto 2 do Vertausche(A[1],A[i]) n= n-1 Verhalde(A,1)

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

View Full Document
http://www2.hawaii.edu/~copley/665/HSApplet.html

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

View Full Document
PARTITION (A,l,r)

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: p = A[i] 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 vertausche (A[j],A[k]) else return k www.inf.fh-flensburg.de/lang/algorithmen/sortieren/quick/quick.html QUICKSORT(A,l,r) if l < r then k=PARTITION (A,l,r) QUICKSORT(A,l,k) QUICKSORT(A,k+1,r) www.brian-borwoski.com/sorting...
View Full Document

{[ snackBarMessage ]}

### Page1 / 8

DatenstrukturenUndAlgorithmen_Vo_20071115 - p = A[i j=l-1...

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

View Full Document
Ask a homework question - tutors are online