Reading the Constraints

Assessment problems are set by people who choose $n$ deliberately. The bound is not flavour text, it is the author telling you which complexity class they intend, and once you can read it the space of plausible approaches collapses from everything you know to two or three things.

The ladder

These are the bounds problem authors set, and they are calibrated for a compiled language at a few seconds:

Bound on $n$	Target	Usually means
$n \le 12$	$O(n!)$	Permutations, brute force over orderings
$n \le 25$	$O(2^n)$	Subsets, meet in the middle
$n \le 500$	$O(n^3)$	Floyd-Warshall, interval dynamic programming
$n \le 5000$	$O(n^2)$	Pairwise dynamic programming, nested scan
$n \le 10^5$	$O(n \log n)$	Sorting, heap, binary search, balanced tree
$n \le 10^6$	$O(n)$	One pass, hash map, two pointers, prefix sums
$n \le 10^{18}$	$O(\log n)$	Binary search, arithmetic, fast exponentiation

Lorem ipsum dolor sit amet, consectetur adipiscing elit. Integer sit amet quam auctor, convallis ligula a, aliquet turpis. Vestibulum fringilla sollicitudin leo sit amet lobortis. Nullam accumsan finibus justo quis sollicitudin. Nam sed volutpat nisl, efficitur convallis purus. Curabitur scelerisque tincidunt turpis, vel ullamcorper magna faucibus a. Etiam non lobortis elit, vel egestas ex. Maecenas quis egestas velit. Pellentesque sit amet dolor laoreet turpis convallis elementum. Cras nec dui non turpis tincidunt maximus vitae commodo elit.

Vivamus maximus leo nec sem ultricies, placerat luctus odio scelerisque. Morbi fringilla est neque. Duis fermentum tempor justo ut laoreet. Lorem ipsum dolor sit amet, consectetur adipiscing elit. Etiam feugiat ipsum in nisl fermentum commodo. Aenean viverra, nisl sed gravida facilisis, felis sem malesuada orci, non tincidunt velit risus id risus. Integer gravida fermentum massa, eu viverra felis iaculis non. Suspendisse sit amet hendrerit erat, eget accumsan libero.

Aenean ut quam efficitur felis pulvinar pulvinar quis in libero. In hac habitasse platea dictumst. Suspendisse potenti. Maecenas vel gravida sem. Aliquam aliquam pellentesque cursus. Sed malesuada lacus dignissim odio varius commodo. Vivamus tristique facilisis lorem.

The rest of this lesson is for subscribers

Unlock every lesson in Programming for Quantitative Developers, and every other premium course.

Subscribe to continue

Test your knowledge

Questions are only available to subscribers.

Continue

NextWindows, Prefixes and Monotonic Stacks

Keep reading Programming for Quantitative Developers

25 lessons in this course, and every other premium course, on one subscription.

Subscribe now

Every lesson in every course, with the worked examples and interactive simulators
Graded questions on every lesson, with explanations for the wrong answers as well as the right one
The trainers, timed assessments and brainteaser library that go with them