AP Computer Science Barron's

Test Preparation AP Test Preparation
81

<p>oh ok, so if it says “dominate”, just compare big-O?</p>

<p>O(n^2) is the worst right?</p>

<p>and is O (n log n) more efficient than O(log n)</p>