Search - Recursion algorithm

Search - Recursion algorithm - List

[VC/MFC] erchashu DL : 0: 编写实现二叉树遍历操作的递归或非递归算法的函数，并在主函数中对其调用。二叉树的叶子结点个数。二叉树的深度-Write realize binary tree traversal of recursion or recursion algorithm, and the function of its main function in the call.
Date : 2026-01-07 Size : 6kb User : 安静霆
[VC/MFC] monkey-eat-peach DL : 0: 该算法简单的描述了递归的实现。可以了解递归，迭代的内涵。适合初学者去练习和参考。-Description of the algorithm is simple and the implementation of factorial. To understand recursion, iteration of the content. For beginners to practice and reference.
Date : 2026-01-07 Size : 1kb User : 小五
[VC/MFC] C-language-description DL : 0: 《算法精解:C语言描述》是数据结构和算法领域的经典之作，十余年来，畅销不衰！《算法精解:C语言描述》共分为三部分：第一部分首先介绍了数据结构和算法的概念，以及使用它们的原因和意义，然后讲解了数据结构和算法中最常用的技术——指针和递归，最后还介绍了算法的分析方法，旨在为读者学习《算法精解:C语言描述》打下坚实的基础；第二部分对链表、栈、队列、集合、哈希表、堆、图等常用数据结构进行了深入阐述；第三部分对排序、搜索数值计算、数据压缩、数据加密、图算法、几何算法等经典算法进行了精辟的分析和讲解。-" Fine solution algorithm: C language description" is a classic in the field of data structures and algorithms, more than ten years, sold briskly! " Fine solution algorithm: C language description" is divided into three parts: The first part introduces the concept of data structures and algorithms, as well as the causes and significance of using them, and then explain the data structures and algorithms most commonly used technique- Pointer and recursion, and finally introduced the analysis algorithm designed for readers to learn " fine solution algorithm: C language description" lay a solid foundation second part lists, stacks, queues, sets, hash tables, heap, Figure other commonly used data structures deeply elaborated third part of the sorting, searching numerical calculation, data compression, data encryption, graph algorithms, geometric algorithms and other classic algorithm incisive analysis and explanation.
Date : 2026-01-07 Size : 7.89mb User : 李志轩
[VC/MFC] jisuanjisuanfayufenxi2 DL : 0: 书主要取材于算法设计与分析领域的经典内容，并介绍了算法设计的发展趋势。内容主要包括非常经典的算法设计技术，例如递归与分治、动态规划、贪心、回溯、分支限界、图算法，也包括了一些高级的算法设计主题-Book is mainly based on classical content in the field of algorithm design and analysis, and introduces the development trend of algorithm design. Content mainly includes the very classic algorithm design techniques, such as recursion and partition, dynamic programming, greedy, backtracking, branch limit, graph algorithm, also include some advanced algorithm design theme
Date : 2026-01-07 Size : 8.57mb User : 牛佳
[VC/MFC] Algorithms-Competitions-Primer DL : 0: 《算法竞赛入门经典》是一本算法竞赛的入门教材，把C/C++语言、算法和解题有机地结合在了一起，淡化理论，注重学习方法和实践技巧。全书内容分为11章，包括程序设计入门、循环结构程序设计、数组和字符串、函数和递归、基础题目选解、数据结构基础、暴力求解法、高效算法设计、动态规划初步、数学概念与方法、图论模型与算法，覆盖了算法竞赛入门所需的主要知识点，并附有大量习题。书中的代码规范、简洁、易懂，不仅能帮助读者理解算法原理，还能教会读者很多实用的编程技巧。另外，书中包含的各种开发、测试和调试技巧也是在传统的语言、算法类书籍中难以见到的。- Algorithms Algorithms Primer is a primer on algorithmic competitions. It combines C/C++ language, algorithms and problem solving together, dilute theory, focus on learning methods and practical skills. The book is divided into 11 chapters, including the introduction of programming, loop structure programming, array and string, function and recursion, the basis of topics selected, data structure, violent solution, efficient algorithm design, dynamic programming, mathematical concepts and Methods, graph theory models and algorithms, covering the algorithm contest entry required the main knowledge points, with a large number of exercises. The book code specification, simple, easy to understand, not only to help readers understand the principles of the algorithm, but also to teach the reader a lot of practical programming skills. In addition, the book contains a variety of development, testing and debugging skills are also in the traditional language, algorithm books are difficult to see
Date : 2026-01-07 Size : 37.46mb User : LeoLie