First Course in Algorithms Through Puzzles
- Publisher's listprice EUR 69.54
-
28 841 Ft (27 468 Ft + 5% VAT)
The price is estimated because at the time of ordering we do not know what conversion rates will apply to HUF / product currency when the book arrives. In case HUF is weaker, the price increases slightly, in case HUF is stronger, the price goes lower slightly.
- Discount 20% (cc. 5 768 Ft off)
- Discounted price 23 073 Ft (21 974 Ft + 5% VAT)
Subcribe now and take benefit of a favourable price.
Subscribe
28 841 Ft
Availability
Not yet published.
Why don't you give exact delivery time?
Delivery time is estimated on our previous experiences. We give estimations only, because we order from outside Hungary, and the delivery time mainly depends on how quickly the publisher supplies the book. Faster or slower deliveries both happen, but we do our best to supply as quickly as possible.
Product details:
- Edition number 2
- Publisher Springer Nature Singapore
- Date of Publication 24 December 2025
- Number of Volumes 1 pieces, Book
- ISBN 9789819680962
- Binding Hardback
- No. of pages188 pages
- Size 235x155 mm
- Language English
- Illustrations X, 188 p. 56 illus., 4 illus. in color. Illustrations, black & white 700
Categories
Long description:
"
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.
" MoreTable of 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.
More
