CRLS and Discrete_Mathematicsand_Its_Applications book notes
then testing the hypotheses by running the algorithms in realistic contexts. The emphasis is on testing algorithms in the context of meaningful applications.
- This is also implied by Do I need any special mathematical background? No, we assume only a basic high school background. So it doesn't even need calculus? (CRLS also needs linear algebra)
- Notice 3rd may be different from the 4th. Sedgewick’s Algorithms in C/C++/Java, Third Edition is more appropriate as a reference or a text for an advanced course
- TODO
- read more after Algorithm Science
- check course in CS 2013 or 2023
- "Dynamic visualizations"
- I didn't find FFT
- This book is very detailed but in Java
- Take this as one example The booksite expands on the exercises in the book by adding drill exercises (with answers available with a click), a wide variety of examples illustrating the reach of the material, programming exercises with code solutions, and challenging problems.
challenging problems may mean Creative Problems.
programming exercises with code solutions Web Exercises
examples i.e. contents before Exercises.
drill exercises i.e. "Exercises"
Links to related material TODO may mean this
In addition, it’ll be a very long time before that work will pay off in terms of bringing new users to Stack Overflow. Our interviews showed even very experienced users of T-SQL felt inadequate to contribute documentation.
For instance, one thing that disappoints me about CLRS is that in covering dynamic programming, it doesn’t emphasize enough that the secret sauce comes from thinking about problems recursively. In general, CLRS doesn’t shy away from throwing low-level details at you when explaining algorithms. But that’s because I already have a big picture framework in my head. If I wanted to learn how to think about algorithms, having never studied the subject before, CLRS would not be my first choice of a textbook. CLRS is still more comprehensive overall (like an encyclopedia) though.
- Dasgupta, Papadimitriou and Vazirani’s Algorithms It’s not at all comprehensive though, and so I have to supplement it a lot, including with material from CLRS and Erickson’s book.
it's an amazing book if you like the combinatorial puzzles that Knuth have worked through over the years I do go through it from time to time, and by this point, I'm familiar enough with the subject area that I no longer find it as daunting as I did all those years ago As a textbook, it works okay for a classroom, that's about it. This book was great when it first came out because it was one of the first comprehensive self-contained textbooks it is fairly accessible (relative to anything else at the time) Pick any modern Algorithm Design text: Skiena, Kleinberg, Sedgwick, and go through its table of contents.
It lacks a certain coherence Within specific chapters, the problems and examples presented seem to jump all over the place as well. There really isn't a unifying thesis for each chapter (or even each problem it discusses), let alone some practical grandiose theory of algorithm design embodied by the book. there aren't any algo-design texts out there that have solved this problem down into mechanization ... (In fact, take any two of Skiena, Kleinberg, Sedgwick, and Dasgupta and you'll have a more readable presentation of everything covered in CLRS).
I took both of my undergrad and graduate courses in Algo through Kleinberg and the one thing that I am most grateful for in my second attempt to understand this material is the clarity of the presentation.
pretty useless if you want to be an engineer though. may be not true as teachyourselfcs says.
find . -name "*.md" | xargs -I{} du -h {}