共查询到17条相似文献，搜索用时 530 毫秒
1.
通过数据结构理论与实验教学中的典型实例,论述了数据结构中递归算法的执行过程、递归算法的描述、应用、递归算法的非递归实现问题和递归算法的具体实现问题. 相似文献
3.
递归算法是程序设计中的一个重要的算法,但在实际应用中有一定的,本文将讨论如何将递归转化为非递归的设计思想,本文对于可以应用的递归程序来讲也具有一定的参考意义. 相似文献
4.
算法分析中计算复杂性常用递归关系来表达,递归方程的求解有助于分析算法设计的好坏。常用的递归方程的求解方法包括生成函数法、特征方程法、递推法等。递归树方法和主方法给出了递归方程计算复杂度的渐进表示。 相似文献
5.
数据结构课程中递归算法教学探讨 总被引：1，自引：0，他引：1
数据结构课程中的递归算法的教学既是重点又是难点.在教学中,教师可以提前引入递归算法,在讲授某些比较简单的问题的非递归算法时,补充递归算法,为比较复杂的问题的递归算法的教学铺平道路.采用该方法后,递归算法的教学取得了较好的效果. 相似文献
6.
随着计算机科学的逐步发展,各种各样的算法相继出现,我们需要对算法进行分析,以选择性能更好的解决方案。算法分析中计算复杂度常用递归方程来表达,因此递归方程的求解有助于分析算法设计的好坏。阐述了常用的3种求解递归方程的方法：递推法、特征方程法和生成函数法。这3种方法基本上可以解决一般规模递归方程的求解问题。 相似文献
7.
9.
递推和递归问题是计算机高级语言程序设计课程中的重点和难点问题。以卖票问题为例,对递推和递归方法进行了探讨,并通过C程序进行了验证。 相似文献
10.
11.
本文讨论了整式一阶递推数列、整式二阶递推数列和分式型递推数列的通项求解问题,利用了特征方程求解法解决了递推数列的通项求解问题。 相似文献
12.
Kelty's “recursive public” is defined as a binary: whether or not ownership of intellectual property is legally in the public domain. We propose a broader continuum of recursive depth, which spans the range from shallow constrained generative spaces (e.g., photo memes) to the deeply open collaborations of “critical making” communities. Recursive depth is assessed by the capacity for transformation across three distinct continuums: public/proprietary, virtual/material, and high/low social power. Transformations across all three continuums is not always necessary for deep recursion (as Kelty and others note for many cases of open source), but we argue that paying attention to all three, and treating them as continuums rather than binaries, allows a better evaluation of the capacity for democratizing the technosocial landscape. 相似文献
13.
14.
This paper presents a size reduction method for the inverted file, the most suitable indexing structure for an information retrieval system (IRS). We notice that in an inverted file the document identifiers for a given word are usually clustered. While this clustering property can be used in reducing the size of the inverted file, good compression as well as fast decompression must both be available. In this paper, we present a method that can facilitate coding and decoding processes for interpolative coding using recursion elimination and loop unwinding. We call this method the unique-order interpolative coding. It can calculate the lower and upper bounds of every document identifier for a binary code without using a recursive process, hence the decompression time can be greatly reduced. Moreover, it also can exploit document identifier clustering to compress the inverted file efficiently. Compared with the other well-known compression methods, our method provides fast decoding speed and excellent compression. This method can also be used to support a self-indexing strategy. Therefore our research work in this paper provides a feasible way to build a fast and space-economical IRS. 相似文献
15.
众所周知数学归纳法的理论根据是皮亚诺的自然数公理和数学归纳法原理,在使用数学归纳法证明无穷数目的命题时,经常说:如此递推下去可知……;那么,这个递推下去的过程到底是有限的还是无限的过程? 相似文献
16.
表达式解析器在软件中有着广泛的应用。主要叙述通过递归算法实现表达式解析以及通过提供操作符和函数注册接口,让开发人员可以自行对解析器进行扩展,从而实现解析器通用的设计思路。 相似文献
17.
This paper considers the state estimation problem for a class of discrete-time non-homogeneous jump Markov linear systems (JMLSs), where the transition probability matrix (TPM) is assumed to be time-variant and takes value in a finite set randomly at each time step. To show the simplicity brought by the finite-valued hypothesis, the optimal recursion for the posterior TPM probability density functions conditioned on that the TPM belongs to a continuous set is firstly derived. Then, we naturally incorporate the proposed TPM estimation into the recursion of system state. Two interacting multiple-model (IMM)-type approximation stages are employed to avoid the exponential computational requirements. The resulting filter reduces to the IMM filter when the number of candidate TPMs is unity. A meaningful example is presented to illustrate the effectiveness of our method. 相似文献