the running time is proportional to the number of inputs provided.
the running time is proportional to the number of inputs provided.
for an algorithm, when the big-o work expression can be expressed in terms of a constant times n, where n is the size of the problem