Informatics Competition Guide Basic Algorithms

The core of this book is nine basic algorithms often used in informatics competitions, including simulation algorithms, recursive algorithms, enumeration algorithms, recursive algorithms, divide-and-conquer algorithms, greedy algorithms, sorting algorithms, high-precision algorithms and search algorithms. This book starts directly with real questions from various competitions. The content is explained from the shallower to the deeper and the design is reasonable: for questions that introduce new knowledge points, the book will provide the complete reference code of the question. However, as the readers gradually deepen their understanding of this knowledge point, subsequent questions of the same type will gradually change to only provide algorithmic ideas, pseudo code and no prompts. For some questions with a large thinking span, this book will give certain tips; in addition, the book also arranges related exercises. Each chapter in this book is divided into two parts: a popularization group and an improvement group. The content involved in the popularization group corresponds to the difficulty of the NOIP popularization group, where readers can initially grasp the ideas and usage of each algorithm; the content involved in the improvement group corresponds to the difficulty of the NOIP improvement group, where readers can review and improve the algorithm content that has been explained. This book is suitable not only as an advanced textbook for readers who have learned introductory knowledge of C++ language and algorithms, but also as an independent book for readers with a certain programming foundation to learn algorithms.