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)
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/
The Art of Computer Programming from Knuth, is what one can consider as a good reference. If you find errors in these books, you get 2,56$/error (reward check). This reward has been going on over years and you get cited, encouranging the books to become perfect. It breaks down all kinds of algorithms and data structures.
Knuth's TAOCP. Also Introduction to Algorithms. These two books were base to almost all my algorithm courses at my uni. Especially the first one is very math-heavy (it explains the math pretty well, you don't have to have some specific math knowledge beforehand).