# Lecture - Functional Programming MT22, VI

### Flashcards

Why might $O(n^2)$ be better than $O(n \log n)$ in some cases?

Because for small $n$ the constants might be different.

Why might $O(n^2)$ be better than $O(n \log n)$ in some cases?

Because for small $n$ the constants might be different.