Dynamic programming algorithms are used for optimization (for example, finding the shortest path between two points, or the fastest way to multiply many matrices).
There were performances, exhibitions of informative posters and a jigsaw puzzle competition where the fastest couple to complete the puzzle will win attractive prizes.
Partially for this reason, spectral methods have excellent error properties, with the so-called exponential convergence being the fastest possible, when the solution is smooth.
