O(
n) is Big O Notation and refers to the complexity of a given algorithm.
n refers to the size of the input, in your case it's the number of items in your list. O(
n)
means that your algorithm will take on the
order of
n operations to insert an item.Dec 16, 2009
read more >>