-
数据结构作业与复习题目
数据结构作业与复习题目-data strcture homework and review
- 2022-12-21 10:30:04下载
- 积分:1
-
数据结构。曲线拟合算法。通过曲线拟合的计算需求曲线…
数据结构。曲线拟合算法。通过曲线拟合法求曲线近似方程-Data structure. Curve fitting algorithm. Demand curve by curve fitting approximation equation
- 2022-03-24 14:10:45下载
- 积分:1
-
oracle OCI 数据类封装
1.oracle OCI 数据类封装 支持linux windows 2.通过封装不同类驱动
- 2022-06-20 12:01:26下载
- 积分:1
-
利用哈夫曼编码构造的完整的编/译码系统,包括初始化、编码、译码、显示等,并将其输出在文件中。...
利用哈夫曼编码构造的完整的编/译码系统,包括初始化、编码、译码、显示等,并将其输出在文件中。-The use of Huffman encoding the complete structure of the encoder/decoder system, including the initialization, encoding, decoding, display and output in the document.
- 2022-01-22 17:55:18下载
- 积分:1
-
图形演示数据结构的树与图遍历算法,vc环境下的windows编程
图形演示数据结构的树与图遍历算法,vc环境下的windows编程-graphic demonstration of the tree data structure with plans traversal algorithm, vc environment of windows programming
- 2022-03-09 20:36:49下载
- 积分:1
-
广义表的反序
逆置广义表的递归模型如下:
F(LS) = null 若 LS 为空
F(LS) = LS ...
广义表的反序
逆置广义表的递归模型如下:
F(LS) = null 若 LS 为空
F(LS) = LS 若 LS 为原子,且 tail(LS) 为空
F(LS) = append( F(tail(LS)), head(LS) ) 若 LS->tag=0 ,且 LS->tp!=null
F(LS) = append( F(tail(LS), F(head(LS)) ) 若 LS->tag=1
其中 append(a,b) 的功能是将广义表 a 和 b 作为元素的广义表连接起来。-Generalized table set against the broad anti-order recursive model of the table is as follows: F (LS) = null if the LS is empty F (LS) = LS if LS for the atoms, and the tail (LS) is empty F (LS) = append (F (tail (LS)), head (LS)) if the LS-> tag = 0, and the LS-> tp! = null F (LS) = append (F (tail (LS), F (head (LS))) If the LS-> tag = 1 where append (a, b) function is a generalized form, and b as elements of generalized tables connected.
- 2022-03-01 20:55:59下载
- 积分:1
-
RMQ的st算法,两道题,一个是一维的,一个是二维的
RMQ的st算法,两道题,一个是一维的,一个是二维的-RMQ the st algorithm, two questions, one is one-dimensional, and one is two-dimensional
- 2022-07-12 03:53:26下载
- 积分:1
-
清华大学数据结构 严蔚敏 PPT+习题答案
清华大学数据结构 严蔚敏 PPT+习题答案-Tsinghua University, Yan Wei-min data structure PPT+ Exercises Answer
- 2022-03-20 23:22:42下载
- 积分:1
-
对给定的N个数进行排序,进行非降次序排序,要求使用归并排序...
对给定的N个数进行排序,进行非降次序排序,要求使用归并排序-The number of a given set of n sorted, according to the non-descending order of arrangement, requires the use of merge sort
- 2022-02-13 07:40:49下载
- 积分:1
-
本人上传的是用贪心算法实现找零钱问题。贪婪算法的根本思想是逐步获得最优解。...
本人上传的是用贪心算法实现找零钱问题。贪婪算法的根本思想是逐步获得最优解。-I uploaded is to use greedy algorithm to find small change problem. Greedy algorithm is the fundamental idea is to gradually get the optimal solution.
- 2022-03-02 15:39:29下载
- 积分:1