My Account Log in

1 option

First Course in Algorithms Through Puzzles / by Ryuhei Uehara.

SpringerLink Books Computer Science (2011-2024) Available online

View online
Format:
Book
Author/Creator:
Uehara, Ryuhei, author.
Contributor:
SpringerLink (Online service)
Series:
Computer Science (Springer-11645)
Language:
English
Subjects (All):
Algorithms.
Algorithm Analysis and Problem Complexity.
Local Subjects:
Algorithm Analysis and Problem Complexity.
Algorithms.
Physical Description:
1 online resource (XI, 175 pages) : 68 illustrations, 3 illustrations in color
Edition:
First edition 2019.
Contained In:
Springer eBooks
Place of Publication:
Singapore : Springer Singapore : Imprint: Springer, 2019.
System Details:
text file PDF
Summary:
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. Although details of the proofs and the analyses of algorithms are also provided, the mathematical descriptions in this book are not beyond the range of high school mathematics. Some famous real puzzles are also used to describe the algorithms. These puzzles are quite suitable for explaining the basic techniques of algorithms, which show how to solve these puzzles.
Contents:
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.
Other Format:
Printed edition:
ISBN:
978-981-13-3188-6
9789811331886
9789811331879
9789811331893
Access Restriction:
Restricted for use by site license.

The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.

Find

Home Release notes

My Account

Shelf Request an item Bookmarks Fines and fees Settings

Guides

Using the Find catalog Using Articles+ Using your account