If an algorithm's runtime grows linearly with its input, it's described as having a time complexity of:

Question $12$ options:

O$(1)$

O$($n$)$

O$($n$^2)$

O$($log n$)$