# Are Two Loops Twice as Slow? Why O(2n) Is Still O(n)

Big-O keeps only the part of the step count that grows fastest and drops the rest, so 2n steps is O(n) and n² + n steps is O(n²). Here's why, and when the small stuff still matters.

![Cheat sheet: Are Two Loops Twice as Slow? Why O(2n) Is Still O(n)](https://fsdtrainingmedia.blob.core.windows.net/public/images/2026/11/78467068e0fd404b98c5104ad8fee653.webp)

- Category: Data Structures
- Level: Apprentice
- Tags: Big-O Notation, Constant Factor, Dominant Term, software-development
- Updated: November 3, 2026

Source: https://www.ask-codey.com/cheat-sheets/big-o-dropping-constants-cheat-sheet