DatenstrukturenUndAlgorithmen_Vo_20071108

DatenstrukturenUndAlgorithmen_Vo_20071108 - Baue_halde(A...

Info iconThis preview shows pages 1–7. Sign up to view the full content.

View Full Document Right Arrow Icon
Background image of page 1

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

View Full DocumentRight Arrow Icon
Background image of page 2
Background image of page 3

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

View Full DocumentRight Arrow Icon
Verhalden(A,i) l-LINKS(i), r=RECHTS(i) index = i if l<=n AND A[l}>A[i] then index=l if r<=n AND A[r}>A[index} then index=r if i!=index then vertausche(A[i],A[index]) verhalde(A,index)
Background image of page 4
Background image of page 5

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

View Full DocumentRight Arrow Icon
Background image of page 6
Background image of page 7
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Baue_halde(A) for i=n/2 downto 1 verhalde(A,i) Baue_halde(A) for i=n/2 downto 1 verhalde(A,i) www2.hawaii.edu/~copley/665/HSapplet.html www.brian-borowski.com/sorting...
View Full Document

This note was uploaded on 11/19/2009 for the course HKJLHKJL 565 taught by Professor Fhfh during the Spring '09 term at University of Graz.

Page1 / 7

DatenstrukturenUndAlgorithmen_Vo_20071108 - Baue_halde(A...

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

View Full Document Right Arrow Icon
Ask a homework question - tutors are online