Datenstrukturen & Algorithmen - belfrage.net

search( , ) l := 1 r := #Elemente von while (l ) then r := m - 1 else return " gefunden" end end.
PDF Herunterladen
PNG-Bilder
3MB Größe 2 Downloads 350 Ansichten
Kommentar
 

  

    2



 

 3

  



  



Median

  



  



  



  



  



  



  



   ▪ ▪

▪ ▪

▪

  search( , )

l := 1 r := #Elemente von while (l ) then r := m - 1 else return " gefunden" end end return " nicht gefunden"

m := (l+(r-l)/2)

O(log(n))



A



x

x ¡ A[l] m = l + (r ¡ l) ¢ A[r] ¡ A[l] 

x

m

  

O(log(log(n))) O(n) ▪











́ 



O(log n).

́

   2 f¡1; 0; +1g

h

h

h

h

h

h



x x

x x x 

x 





   ▪ ▪













   ▪

37



 

38









 

















  ▪ ▪ ▪

 ▪ ▪ ▪ ▪

51

  k k k

k

k



52





53

mn

 

st



54