title: data structure performance in Big-O notation
body: <p>Is there a good reference (table or chart) out there somewhere that shows all the time and space complexity in Big-O notation, for all the common operations (add,remove,iterate,etc.) for many of the common data structures (list,array,hash,tree,etc.)?  The more complete the better.</p>