000 03072nam a22004575i 4500
001 978-981-13-3188-6
003 DE-He213
005 20240423125118.0
007 cr nn 008mamaa
008 181206s2019 si | s |||| 0|eng d
020 _a9789811331886
_9978-981-13-3188-6
024 7 _a10.1007/978-981-13-3188-6
_2doi
050 4 _aQA76.9.A43
072 7 _aUMB
_2bicssc
072 7 _aCOM051300
_2bisacsh
072 7 _aUMB
_2thema
082 0 4 _a518.1
_223
100 1 _aUehara, Ryuhei.
_eauthor.
_0(orcid)0000-0003-0895-3765
_1https://orcid.org/0000-0003-0895-3765
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
245 1 0 _aFirst Course in Algorithms Through Puzzles
_h[electronic resource] /
_cby Ryuhei Uehara.
250 _a1st ed. 2019.
264 1 _aSingapore :
_bSpringer Nature Singapore :
_bImprint: Springer,
_c2019.
300 _aXI, 175 p. 68 illus., 3 illus. in color.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
505 0 _aChapter 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.
520 _aThis 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.
650 0 _aAlgorithms.
650 1 4 _aAlgorithms.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9789811331879
776 0 8 _iPrinted edition:
_z9789811331893
856 4 0 _uhttps://doi.org/10.1007/978-981-13-3188-6
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
942 _cSPRINGER
999 _c174373
_d174373