000 | a | ||
---|---|---|---|
999 |
_c32285 _d32285 |
||
008 | 230903b xxu||||| |||| 00| 0 eng d | ||
020 | _a9781032417585 | ||
082 |
_a005.131 _bMAT |
||
100 | _aMatuszek, David L. | ||
245 | _aQuick recursion | ||
260 |
_bCRC Press, _c2023 _aBoca Raton : |
||
300 |
_axiii, 143 p. ; _bill., _c22 cm |
||
365 |
_b22.99 _cGBP _d110.40 |
||
490 | _aQuick programming | ||
504 | _aIncludes bibliographical references and index. | ||
520 | _aRecursion 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. | ||
650 | _aGame Programming and Design | ||
650 | _aBinary tree | ||
650 | _aData structure | ||
650 | _aDebugging | ||
650 | _a Empty binary treee | ||
650 | _aFrog puzzle | ||
650 | _aMake tree methods | ||
650 | _aName method | ||
650 | _aOk ToColor method | ||
650 | _aRecursive drawings | ||
650 | _aReverse method | ||
650 | _aSolvable functions | ||
650 | _a toString method | ||
650 | _aYes method | ||
942 |
_2ddc _cBK |