Minor changes to the example programs.
3 {/globaldict where{pop globaldict}{userdict}ifelse/pdfmark/cleartomark load put}
8 /Action/GoTo/Dest(section.1)cvn
12 /Action/GoTo/Dest(subsection.1.1)cvn
15 /Title(Problem-/Anwendungsbereiche:)
16 /Action/GoTo/Dest(subsection.1.2)cvn
20 /Action/GoTo/Dest(subsection.1.3)cvn
23 /Title(Divide and Conquer)
25 /Action/GoTo/Dest(section.2)cvn
28 /Title(Formulierung des Divide and Conquer Prinzips)
29 /Action/GoTo/Dest(subsection.2.1)cvn
34 /Action/GoTo/Dest(subsection.2.2)cvn
38 /Action/GoTo/Dest(subsubsection.2.2.1)cvn
42 /Action/GoTo/Dest(subsubsection.2.2.2)cvn
45 /Title(N\344chste Paare)
47 /Action/GoTo/Dest(subsection.2.3)cvn
51 /Action/GoTo/Dest(subsubsection.2.3.1)cvn
55 /Action/GoTo/Dest(subsubsection.2.3.2)cvn
58 /Title(Segmentschnitt)
60 /Action/GoTo/Dest(subsection.2.4)cvn
64 /Action/GoTo/Dest(subsubsection.2.4.1)cvn
68 /Action/GoTo/Dest(subsubsection.2.4.2)cvn
71 /Title(Polynomprodukt und Fast Fourier-Transformation \(TODO\))
72 /Action/GoTo/Dest(subsection.2.5)cvn
75 /Title(Randomisierung)
77 /Action/GoTo/Dest(section.3)cvn
80 /Title(Randomisierter Quicksort)
82 /Action/GoTo/Dest(subsection.3.1)cvn
86 /Action/GoTo/Dest(subsubsection.3.1.1)cvn
89 /Title(Randomisierter Primzahltest \(TODO\))
90 /Action/GoTo/Dest(subsection.3.2)cvn
94 /Action/GoTo/Dest(subsection.3.3)cvn
97 /Title(Treaps \(TODO\))
98 /Action/GoTo/Dest(subsection.3.4)cvn
101 /Title(Hashing \(TODO\))
102 /Action/GoTo/Dest(subsection.3.5)cvn
105 /Title(Amortisierte Analyse \(TODO\))
107 /Action/GoTo/Dest(section.4)cvn
110 /Title(Binomial Heaps \(TODO\))
111 /Action/GoTo/Dest(subsection.4.1)cvn
114 /Title(Fibonacci Heaps \(TODO\))
115 /Action/GoTo/Dest(subsection.4.2)cvn
118 /Title(Union Find \(TODO\))
119 /Action/GoTo/Dest(subsection.4.3)cvn
124 /Action/GoTo/Dest(section.5)cvn
127 /Title(K\374rzeste \(billigste\) Wege)
129 /Action/GoTo/Dest(subsection.5.1)cvn
132 /Title(Single Source Shortest Paths)
133 /Action/GoTo/Dest(subsubsection.5.1.1)cvn
136 /Title(Spannb\344ume minimalen Gewichts)
138 /Action/GoTo/Dest(subsection.5.2)cvn
141 /Title(Das Wachsen von min. Spannb\344umen)
142 /Action/GoTo/Dest(subsubsection.5.2.1)cvn
146 /Action/GoTo/Dest(subsubsection.5.2.2)cvn
149 /Title(Sichere Kanten)
150 /Action/GoTo/Dest(subsubsection.5.2.3)cvn
154 /Action/GoTo/Dest(subsubsection.5.2.4)cvn
157 /Title(Algorithmus von Kruskal)
158 /Action/GoTo/Dest(subsubsection.5.2.5)cvn
161 /Title(Algorithmus von Prim)
162 /Action/GoTo/Dest(subsubsection.5.2.6)cvn
167 /Action/GoTo/Dest(section.6)cvn
170 /Title(Online Verfahren)
172 /Action/GoTo/Dest(subsection.6.1)cvn
175 /Title(Next Fit \(NF\))
176 /Action/GoTo/Dest(subsubsection.6.1.1)cvn
179 /Title(First-Fit \(FF\))
180 /Action/GoTo/Dest(subsubsection.6.1.2)cvn
183 /Title(Best-Fit \(BF\))
184 /Action/GoTo/Dest(subsubsection.6.1.3)cvn
187 /Title(Offline Verfahren)
189 /Action/GoTo/Dest(subsection.6.2)cvn
192 /Title(First Fit Decreasing \(FFD oder FFNI\))
193 /Action/GoTo/Dest(subsubsection.6.2.1)cvn
196 /Title(Best Fit Decreasing \(BFD\))
197 /Action/GoTo/Dest(subsubsection.6.2.2)cvn
200 /Title(Dynamische Programmierung)
202 /Action/GoTo/Dest(section.7)cvn
205 /Title(Matrixkettenprodukt \(TODO\))
206 /Action/GoTo/Dest(subsection.7.1)cvn
209 /Title(Optimale Suchb\344ume \(TODO\))
210 /Action/GoTo/Dest(subsection.7.2)cvn
213 /Title(Editierdistanz)
214 /Action/GoTo/Dest(subsection.7.3)cvn
217 /Title(Suche in Texten)
218 /Action/GoTo/Dest(section.8)cvn
221 /Title(Landau-Symbole)
222 /Action/GoTo/Dest(appendix.A)cvn