AlgDatOverview

Algorithmes and datastructures

Problems and algorithmes

Datastructures

Divide and Conquer

Sorting in linear time

Tree and roots

Dynamic programming

Greedy algorithmes

Traversing of graphs

Minimal spenntrees

One to all

All to all

Maximal flow

NP-complete

Pseudocode

RAM-model

Problem, instance, problemsize

Asymtotic notation

BC, AC, WC

Loop-invariant, induction

Recursive decomponation

INSERTION-SORT

Stack

Queue

Linked list

Pointers and objects

Hash-table

Chaining

Hash function

Amoritized analysis

Dynamic table