This book is an introductory guide to data structures and algorithms. It is not limited to a specific language. It skips complex mathematical formulas and introduces the basic concepts of data structures and algorithms to programming beginners in an easy-to-understand way, cultivating readers' programming logic. The main contents include: why we need to understand data structures and algorithms, Big O notation and its code optimization and utilization, the reasonable use of stacks, queues, etc., Etc.
Reader comments
This book is really suitable for a programming beginner like me! It explains data structures and algorithms in a simple and easy-to-understand way, without requiring advanced mathematical knowledge at all. The author also used a lot of diagrams to make it easy for me to understand. I feel that after mastering this knowledge, I can write more efficient code! Recommended to everyone!
It is very helpful as an introduction to algorithms. At least it allows me to understand how to calculate the time complexity of an algorithm.
The best introductory book on algorithms 📚 I've seen on Tomato 🍅.
Data structures and algorithms are the most beneficial tools for building the programming world;
In an easy-to-understand way, this book introduces readers to the basic knowledge of data structures and algorithms, as well as the key to understanding and mastering the concepts.
The ocean of algorithmic knowledge is so vast and profound that it would take several years to learn it, and it is difficult to cover it all in one book;
Therefore, it is more important to be able to explain some concepts well and be a good guide for readers - the author has done a good job of serving as a guide through vivid illustrations and practical examples.
In addition to the basic concepts of common data structures such as arrays, linked lists, stacks, and queues, this book also includes extended knowledge such as binary search, recursion, and graphs. What needs to be especially mastered is: the time complexity and space complexity analysis of algorithms.
Time complexity measures the time required to execute an algorithm, and space complexity takes into account the storage space required by the algorithm.
Only by mastering these two indicators can we better evaluate the performance of different algorithms.
This is a very good book that brought the knowledge of data structures into my mind. It has cases and illustrations, and the text explanations are simple and there are no complicated mathematical formulas. Highly recommended (despite this, I watched it intermittently for 13 days [face covering])
Very useful for beginners
It was good, I learned a lot.
It's relatively simple, but it's still okay as a lead in.
This book is really suitable for a programming beginner like me! It explains data structures and algorithms in a simple and easy-to-understand way, without requiring advanced mathematical knowledge at all. The author also used a lot of diagrams to make it easy for me to understand. I feel that after mastering this knowledge, I can write more efficient code! Recommended to everyone!
It is very helpful as an introduction to algorithms. At least it allows me to understand how to calculate the time complexity of an algorithm.
The best introductory book on algorithms 📚 I've seen on Tomato 🍅. Data structures and algorithms are the most beneficial tools for building the programming world; In an easy-to-understand way, this book introduces readers to the basic knowledge of data structures and algorithms, as well as the key to understanding and mastering the concepts. The ocean of algorithmic knowledge is so vast and profound that it would take several years to learn it, and it is difficult to cover it all in one book; Therefore, it is more important to be able to explain some concepts well and be a good guide for readers - the author has done a good job of serving as a guide through vivid illustrations and practical examples. In addition to the basic concepts of common data structures such as arrays, linked lists, stacks, and queues, this book also includes extended knowledge such as binary search, recursion, and graphs. What needs to be especially mastered is: the time complexity and space complexity analysis of algorithms. Time complexity measures the time required to execute an algorithm, and space complexity takes into account the storage space required by the algorithm. Only by mastering these two indicators can we better evaluate the performance of different algorithms.
This is a very good book that brought the knowledge of data structures into my mind. It has cases and illustrations, and the text explanations are simple and there are no complicated mathematical formulas. Highly recommended (despite this, I watched it intermittently for 13 days [face covering])
Very useful for beginners
It was good, I learned a lot.
It's relatively simple, but it's still okay as a lead in.