{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

DatenstrukturenUndAlgorithmen_Vo_20080110

DatenstrukturenUndAlgorithmen_Vo_20080110 - t = von...

Info iconThis preview shows pages 1–10. 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 Document Right 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 Document Right Arrow Icon
Background image of page 4
Suche (A,x) i = 0; While i < n i = i + 1 if (A[i] == x) RETURN i else RETURN -1
Background image of page 5

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

View Full Document Right Arrow Icon
Background image of page 6
BINSUCHE(von,bis,x) if von <= bis then m = floor ((von + bis)/2) if x = A[m] then return m else if x < A[m] then m = BINSUCHE(von,m -1,x) else then m = BINSUCHE(m+1,bis,x) else m = -1
Background image of page 7

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

View Full Document Right Arrow Icon
INTSUCH(von,bis,x) IF A[von] < A[bis] THEN
Background image of page 8
Background image of page 9

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

View Full Document Right Arrow Icon
Background image of page 10
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: t = von + floor((bis - von) * (x - A[von])/(A[bis]-A[von])) [bis]) + von^2) IF x = A[t] then RETURN t ELSE IF x < A[t] THEN RETURN INTSUCH(von,t-1,x) ELSE RETURN INTSUCH(t+1,bis,x) ELSE IF x = A[von] THEN RETURN von ELSE RETURN -1...
View Full Document

{[ snackBarMessage ]}