First Course in Algorithms Through Puzzles

Ryuhei Uehara (Autor)

Buch | Hardcover

188 Seiten

2026 | Second Edition 2026
Springer Nature Switzerland AG (Verlag)
978-981-96-8096-2 (ISBN)

Titel nicht im Sortiment

Artikel merken

This textbook introduces basic algorithms and explains their analytical methods. All algorithms and methods introduced in this book are well known and frequently used in real programs. Intended to be self-contained, the contents start with the basic models, and no prerequisite knowledge is required. This book is appropriate for undergraduate students in computer science, mathematics, and engineering as a textbook, and is also appropriate for self-study by beginners who are interested in the fascinating field of algorithms.

More than 40 exercises are distributed throughout the text, and their difficulty levels are indicated. Solutions and comments for all the exercises are provided in the last chapter. These detailed solutions will enable readers to follow the author’s steps to solve problems and to gain a better understanding of the contents.

Ryuhei Uehara is a professor in the School of Information Science at the Japan Advanced Institute of Science and Technology. He was a researcher at CANON Inc. Later, he joined Tokyo Woman's Christian University as an assistant professor and was later also a lecturer and associate professor at Komazawa University. He had been a visiting scholar at the University of Waterloo (Canada), the Massachusetts Institute of Technology (USA), Simon Fraser University (Canada), the Université libre de Bruxelles (Belgium), ETH Zürich (Switzerland), and the Universitat Politècnica de Catalunya (Spain). His research interests include computational complexity, algorithms and data structures, and graph algorithms. He is especially engrossed in computational origami, games, and puzzles from the viewpoints of theoretical computer science. He is one of two translators of the New Martin Gardner Mathematical Library into Japanese.

Chapter 1. Preliminaries.- Chapter 2. Recursive call.- Chapter 3. Algorithms for Searching and Sorting.- Chapter 4. Searching on graphs.- Chapter 5. Backtracking.- Chapter 6. Randomized Algorithms.- Chapter 7. References.- Chapter 8. Answers to exercises.

Erscheinungsdatum	13.06.2025
Zusatzinfo	4 Illustrations, color; 52 Illustrations, black and white
Verlagsort	Cham
Sprache	englisch
Maße	155 x 235 mm
Themenwelt	Informatik ► Theorie / Studium ► Algorithmen
Themenwelt	Mathematik / Informatik ► Mathematik ► Angewandte Mathematik
Schlagworte	Algorithm Analysis • Algorithm analysis and problem complexity • algorithms • computer programming • data structure • Puzzle
ISBN-10	981-96-8096-4 / 9819680964
ISBN-13	978-981-96-8096-2 / 9789819680962
Zustand	Neuware