wk2(bigo)

explain o(1)

The method runs in O(1) time (ie “constant time”) relative to its input. The list could contain 1 item or 1,000 items but the algorithm is still only required to do one print.

explain o(n)

The method runs in O(n) time (ie “linear time”) relative to its input. If the list has 10 items – then have to print 10 items If the list has 1,000 items – then have to print 1,000 items