\begin{lstlisting}[caption={Rekursive Implementierung des Rucksackproblems}]
int knapsack (int cap) {
    int i, space, max, t;
    for (i = 0, max = 0; i < N; i++)
        if ((space = cap - items[i].size) >= 0)
            if ((t = knapsack(space) + items[i].value) > max)
                max = t;
    return max;
}
\end{lstlisting}