The common theme that I see in my courses is the worst / best results for trees, hash tables, equations like log n. I am wondering if there is a de facto place where people refer to find such information (textbook, online, etc.), Besides Wikipedia. I hope to find something that mathematically breaks such algorithms / data structures.
For example, something that explains why inserting into a binary heap is O (log2n)
source
share