![](https://cos-cdn.shuashuati.com/pipixue-web/2020-1231-2005-12/ti_inject-812ce.png)
In a time-complexity expression such as O(n 2 ),
A.
The variable n represents the size of the computing problem, e.g., the number of elements in a list to be sorted
B.
The exact number of key computational steps is not necessarily equal to n 2
C.
The term n 2 describes the general trend of increase in running time
D.
All of the options given