o
Merge
Sorting sequences of strings
o
Bucketsort
Single source single
target shortest path
Single source shortest path
o
Dijks
tra
(“Further information”
nicht vergessen
!)
All
-
pairs shortest paths
o
Bellman
-
Ford
o
Floyd
-
Warshall
o
Shortest paths by repeated squaring
Minimum spanning tree
o
Prim
Maximum spanning forest
o
Kruskal for maximum spanning forest
(“Known variants” nicht vergessen”!)
(kleine Korrektur im Induction Step)
Abstrakte Datenstrukturen und ihre Implementationen:
Linear sequence
o
Linked list
Linked list: number
Linked list: find
Linked list: insert at position
Linked list: remove
o
Doubly
-
linked list
Doubly
-
linked list: insert at
position
Doubly
-
linked list: remove
o
Array list
Array list: number
Array list: find
Array
list: insert at position
Array list: remove
Sorted sequence
o
Binary search tree
Binary search tree: find
Binary search tree: insert
Binary search tree: remove
Binary search tree: remove node
Binary search tree: traverse
o
B
-
tree
B
-
tree: find