A routine compares every pair among `n` records once. Which time bound describes its domi…

A routine compares every pair among `n` records once. Which time bound describes its dominant growth?

1. `O(n²)`
2. `O(n)` because each individual comparison is constant-time
3. `O(2n)` because each pair contains two records