Scan barcode
omnia_ahmed's review
5.0
Great introduction, highly recommended for beginners.
Interesting approach to a very interesting subject.
Interesting approach to a very interesting subject.
andgineer's review
1.0
Автор утвердает (слушал его в подкасте), что написал эту книгу для студентов, но потом и доктора наук его благодарили, что нашли в ней материал для обучения своих студентов.
Если коротко - это ужас. Максимум для младших школьников, чтобы дать им просто почувствовать, что такое алгоритмы, скрыв практически все детали.
Но даже младшим школьникам я бы наверно это не посоветовал.
Читать я перестал в том месте где автор сказал, что quick sort лучше, чем merge sort за счет не учитываем в big O нотации константы 8-(
Это где-то в районе первой четверти книги. Все, что я пролистал до этого момента было примивно-дурашливо, без объяснения сути. Такое впечатление, что книга для "лириков", которые в принципе не могут понять математический язык, но нафиг им тогда лезть в эту область?
Если коротко - это ужас. Максимум для младших школьников, чтобы дать им просто почувствовать, что такое алгоритмы, скрыв практически все детали.
Но даже младшим школьникам я бы наверно это не посоветовал.
Читать я перестал в том месте где автор сказал, что quick sort лучше, чем merge sort за счет не учитываем в big O нотации константы 8-(
Это где-то в районе первой четверти книги. Все, что я пролистал до этого момента было примивно-дурашливо, без объяснения сути. Такое впечатление, что книга для "лириков", которые в принципе не могут понять математический язык, но нафиг им тогда лезть в эту область?
therealmlg's review
5.0
Extremely clear and engaging book that's perfect for beginners to algorithmic concepts or for more seasoned folks who want to brush up on foundational ideas by thinking about them in a different way. Examples along the way are a great way to stay engaged with the material and the questions are well-written. I also recommend trying to write the functions in your language of choice before they are presented -- this book uses Python -- it's a great way to stay engaged and test comprehension.
Explanations of recursion and Big O notation in this book are among the best I have ever encountered, and most clear (without skipping the logic that underpins the concepts, like logarithms and call stacks). Ideas presented become more and more abstracted and general as it proceeds and serve as a way to dip your toe into subtopics in algorithmic problem-solving without needing to understand every detail. This part was less interesting to me because it didn't lead to any major paradigm shifts in thinking, but I enjoyed it all nonetheless.
Explanations of recursion and Big O notation in this book are among the best I have ever encountered, and most clear (without skipping the logic that underpins the concepts, like logarithms and call stacks). Ideas presented become more and more abstracted and general as it proceeds and serve as a way to dip your toe into subtopics in algorithmic problem-solving without needing to understand every detail. This part was less interesting to me because it didn't lead to any major paradigm shifts in thinking, but I enjoyed it all nonetheless.
0x5d's review
4.0
I read this book to take a break from denser ones, and it liked it a lot. I wish I had read it when I started college, and I think it would have done a better job than my Data Structures and Algorithms teacher. Although I was already familiar with some of the algorithms explained in it, it was great to brush up on some concepts, and I found the drawings quite funny.
However, I think a complete beginner -the book's target reader, from what I can see- would still find it challenging, because the author chooses to arbitrarily skim over some parts. For example, bubble sort isn't even mentioned. Now, I don't think bubble sort is all that relevant in every-day programming, but it's great for providing a background on the things that more efficient algorithms -like quicksort or mergesort - improve upon.
Some parts are very code-example heavy, while others, like the chapter on dynamic programming, are not, which I think it's a shame because I've seen many beginners (including myself, 7 years ago) struggle with the leap from linear (i.e. arrays, list) to matrix thinking. I understand that the aim of this book is the opposite of being comprehensive and dense, but I think it would have been worth having them.
Nevertheless, I really enjoyed reading it and I look forward to reading Grokking Machine Learning.
However, I think a complete beginner -the book's target reader, from what I can see- would still find it challenging, because the author chooses to arbitrarily skim over some parts. For example, bubble sort isn't even mentioned. Now, I don't think bubble sort is all that relevant in every-day programming, but it's great for providing a background on the things that more efficient algorithms -like quicksort or mergesort - improve upon.
Some parts are very code-example heavy, while others, like the chapter on dynamic programming, are not, which I think it's a shame because I've seen many beginners (including myself, 7 years ago) struggle with the leap from linear (i.e. arrays, list) to matrix thinking. I understand that the aim of this book is the opposite of being comprehensive and dense, but I think it would have been worth having them.
Nevertheless, I really enjoyed reading it and I look forward to reading Grokking Machine Learning.
bigfreakbaby's review
5.0
Super great/intuitive explanations if you're trying to get into CS. If you've taken any CS though, most of this will be fairly basic. Look at the table of contents, and read chapters on whatever you don't know