-
实现B
实现B-树的创建、插入、删除、遍历等功能，并以层序方式通过程序台显示输出。-B-tree to achieve the creation, insertion, deletion, traversal functions, and to sequence through the procedure showed that the output of Taiwan.
- 2023-07-03 22:30:04下载
- 积分：1
-
VFP do with the labeling statements
VFP做的报表与标签-VFP do with the labeling statements
- 2023-01-17 14:45:03下载
- 积分：1
-
常用算法的C语言描述。里边算法非常详尽。解压即可使用。
常用算法的C语言描述。里边算法非常详尽。解压即可使用。-common algorithms described in C language. Inside algorithm very detailed. Decompression can be used.
- 2023-03-24 02:55:03下载
- 积分：1
-
Using ADO from C
Using ADO from C-Using ADO from C
- 2023-06-21 23:20:03下载
- 积分：1
-
一个简单的minisql，能实现sql语句的基本功能，创建、查询和删除，创建索引等...
一个简单的minisql，能实现sql语句的基本功能，创建、查询和删除，创建索引等-a simple minisql, sql statement to achieve the basic functions to create, search and delete, create indexing
- 2022-03-31 05:45:08下载
- 积分：1
-
算法是一种字符串匹配算法！源代码介绍…
bm算法是串的一种匹配算法！本源代码介绍了bm算法的c实现。-bm algorithm is a string matching algorithm! Source code introduced bm Algorithm c achieve.
- 2023-05-22 10:20:03下载
- 积分：1
-
一个简单的记录集类，可以操作单个数据文件，可以用来存放单表数据...
一个简单的记录集类，可以操作单个数据文件，可以用来存放单表数据-A simple type recordsets, you can operate a single data file that can be used to store a single table of data
- 2022-02-25 10:11:58下载
- 积分：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
-
adjoining table with no plans to the depth
用邻接表表示无向图的深度优先搜索遍历 有助于大家理解图的优先遍历问题-adjoining table with no plans to the depth-first search traverse help you understand the plans of the priority issues Traversing
- 2023-03-17 05:50:04下载
- 积分：1
-
物业缴费管理系统
物业缴费管理系统-property Payment Management System
- 2022-06-17 19:03:44下载
- 积分：1
