-
堆排序:思想: 用二叉树的结构来表示数组,及用数组来表示二叉树的结构,比如i为父节点其孩子为,2i,和2i+1.其中,大顶堆中 父节点大于其两个孩子
算法平...
堆排序:思想: 用二叉树的结构来表示数组,及用数组来表示二叉树的结构,比如i为父节点其孩子为,2i,和2i+1.其中,大顶堆中 父节点大于其两个孩子
算法平均时间复杂度: O(nlogn)
-HEAPSORT: thinking: using binary tree structure to express the array, and used to express an array of binary tree structure, such as i the parent node for its children, 2i, and 2i+ 1. Among them, the big top of a pile of the parent node greater than two children on average time complexity of algorithm: O (nlogn)
- 2022-07-11 06:36:53下载
- 积分:1
-
访问数据库,实现教务管理的功能
access数据库,实现教务管理的功能-access databases, realize the functions of educational administration
- 2023-07-18 07:35:03下载
- 积分:1
-
计算机销售系统 一个不错的程序
计算机销售系统 一个不错的程序-computer sales system a good procedure
- 2023-01-31 00:40:04下载
- 积分:1
-
data print
条码标签打印直接连接数据库实现数据灵活打印-data print
- 2022-06-19 18:33:34下载
- 积分:1
-
不错的代码 希望大家喜欢 别忘了看完以后联系我
不错的代码 希望大家喜欢 别忘了看完以后联系我 -good code hope you like do not forget to contact me after reading
- 2022-10-09 22:45:04下载
- 积分:1
-
PHP 连接
Java 检测 distruibuidos 数据库, PHP 执行情况
- 2022-10-26 16:25:03下载
- 积分:1
-
a three
一个三层应用程序,演示如何通过ADO对象以及存储在SQL Server中的Procedure实现高性能的数据访问(在运行程序前首先要设置SQL Server,在压缩包中有一个Procs.sql的文件,首先在SQL Server上运行该文件设置SQL Server数据库)-a three-tier applications, demonstrating how ADO and SQL Server stored in the Procedure to achieve high-performance data access (in the first before running the program to set up SQL Server, in a compressed Procs.sql a document, the first in SQL Server running on the document set up SQL Server database)
- 2022-03-26 07:17:48下载
- 积分: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所完成的程序, 有详细的说明...
二叉树操作&图的遍历操作, 完全按照里面的文挡用VC所完成的程序, 有详细的说明-binary tree traversal operation of the plan operations, in full accordance with the text inside the block with VC performed by the procedure is described in detail in
- 2022-12-30 12:20:03下载
- 积分: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