4 ms·
Pick a small enough bound and certain O(n^2) algorithms will behave better than certain O(n log n) algorithms. Big O notation doesn't take into account constan
by Dylan16807 4y ago
Pick a small enough bound and certain O(n^2) algorithms will behave better than certain O(n log n) algorithms.
Big O notation doesn't take into account constant factors of overhead or plain old once-per-run overhead.
- vitiral 4y agoSorry it was indeed a typo