Java collection tutorial

O(1) - For performing an operation required constant number of steps (e.g., 1, 5, 10 or another number), and this number does not depend on the amount of input data.
O(log(N)) - To perform an operation on the N elements are necessary number of steps of the order of log (N), wherein the base of the logarithm is the most commonly 2.
O(N) - To perform an operation on N elements needed approximately as many steps as are the elements.