Algorithms are one of the important cornerstones of computer science. Algorithms are the soul of programs. Only by mastering the algorithms can we easily control program development.
There are 4 volumes in the Detailed Algorithm Series, and this book is Volume 1 - Fundamentals of Algorithms. There are 6 chapters in this book, which mainly introduces 4 topics, namely progressive analysis and big O notation, divide and conquer algorithm and master method, randomization algorithm, and sorting and selection. Appendix A and Appendix B briefly introduce the relevant knowledge of data induction method and discrete probability. Each chapter of this book has quizzes, end-of-chapter exercises and programming questions, which provides readers with more convenience for self-examination and further learning.
This book provides rich and practical information for readers who are interested in algorithms, and can help readers improve their algorithmic thinking ability. This book is suitable for college teachers and students majoring in computer science, IT professionals who want to cultivate and train algorithmic thinking and computational thinking, as well as candidates and interviewers preparing for interviews as a reading reference.
Reader comments
The characters and experiences in the book are also very interesting, making complex algorithms easier to understand. And each chapter has quizzes and exercises to help readers consolidate their knowledge. I think this book is very helpful to improve algorithmic thinking and is worth reading.
The characters and experiences in the book are also very interesting, making complex algorithms easier to understand. And each chapter has quizzes and exercises to help readers consolidate their knowledge. I think this book is very helpful to improve algorithmic thinking and is worth reading.