Comparison insertion/search time between different Collection class

Question

Hi,
Does someone know where I can find a clear an complete comparison between different JAVA class which implements interface Collection?
I want to compare:
- elements insertion time
- elements search/removal time
Thank you very much in advance
Diego

Answer 1

from wikipedia: Its purpose is to characterize a function's behavior for very large (or very small) inputs in a simple but rigorous way that enables comparison to other functions.
meaning if I ask how quick an algorithm is you might say it completes in 10 seconds but the next time you run it it might take 8 seconds. It kind of depends on what else your computer is doing/ how fast your computer is or how much data you are putting through ie if the puter has little memory it might need to use virtual memory which will have an effect on your performance.
Big O notation identifies how much work has to be carried out. The easiest example is a simple search of an array:
for (int i = 0; i < array.length; i++) {
  if (array[i] == "weijewr") {
    return i;
}Where n represents a number of elements:
This takes O(n) (big Oh of N) as potentially you need to look at each element.
if you were to write a standard bubble sort it would be O(n2) as potentially you need to iterate the array once for each element.