{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

DatenstrukturenUndAlgorithmen_Vo_20080110

# DatenstrukturenUndAlgorithmen_Vo_20080110 - t = von...

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

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
Suche (A,x) i = 0; While i < n i = i + 1 if (A[i] == x) RETURN i else RETURN -1

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

View Full Document
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

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

View Full Document
INTSUCH(von,bis,x) IF A[von] < A[bis] THEN

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: 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 ]}