Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
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)
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).