De Facto Reference for Algorithm Performances?

Question

A common theme I'm seeing in my courses are worst/best case performances for trees, hash tables, equations such as log n. I'm wondering if there's a de facto place where people refer to find this sort of information (textbook, online, etc) besides Wikipedia. I'm hoping to find something that mathematically breaks down such algorithms/data structures.

For example something that explains why insertion into a binary heap is O(log2n)

Answer 1

Someone from Stack Overflow linked this to me the other day(I can't find it now). Is this what you're looking for? http://www.itl.nist.gov/div897/sqg/dads/