000 | 01242cam a2200301 i 4500 | ||
---|---|---|---|
001 | 22839134 | ||
003 | NU | ||
005 | 20250516150455.0 | ||
008 | 221024s2023 flua 001 0 eng | ||
010 | _a 2022041466 | ||
020 |
_a978-1-032-41758-5 _q(paperback) |
||
040 |
_aNU FAIRVIEW _cNU FAIRVIEW |
||
050 | 0 | 0 | _aQA 76.6 M38 2023 |
082 | 0 | 0 |
_a005.13/1 _223/eng/20221107 |
100 | 1 |
_aMatuszek, David L., _eauthor. |
|
245 | 1 | 0 |
_aQuick recursion / _cDavid Matuszek. |
250 | _aFirst edition. | ||
260 |
_aBoca Raton : _bCRC Press/Taylor and Francis, _c2023. |
||
300 |
_axiii, 143 pages : _billustrations ; _c22 cm. |
||
365 | _b2637.40 | ||
490 | 0 | _aQuick programming | |
504 | _aIncludes index. | ||
505 | _a1. Understanding Recursion, 2. Data Structures, 3. Backtracking | ||
520 |
_a"Recursion is considered to be an "advanced" topic. It shouldn't be. While this little volume covers a number of advanced topics that involve recursion - tail recursion, pruning, recursive data structures, the use of accumulators, and backtracking - this book shows how recursion itself is actually rather simple"-- _cProvided by publisher. |
||
650 | 0 | _aRECURSIVE PROGRAMMING. | |
650 | 0 | _aRECURSION THEORY. | |
942 |
_2lcc _cBK _n0 |
||
999 |
_c6092 _d6092 |