-
一个非常简单的项目代码
工作的任务，是负责一个项目的部分代码
对一幅带有人脸信息的24位真彩色bmp文件,通过基于肤色信息的彩色图象分割法,对人脸区域的检测,以及区域标定-On a piece of information with a human face 24 true color bmp files, color information based on color image segmentation method of human face region detection, as well as regional calibration
- 2022-04-28 12:26:48下载
- 积分：1
-
Visual Basic编程实例与技巧（数据库 编程）,本书着重讲述了数据库编程...
Visual Basic编程实例与技巧（数据库 编程）,本书着重讲述了数据库编程-Visual Basic programming examples and techniques (database programming), this book focuses on the Database Programming
- 2022-06-15 09:15:49下载
- 积分：1
-
CShap代码
冒泡排序，选择排序，插入排序，希尔排序
算法
CShap代码
冒泡排序，选择排序，插入排序，希尔排序
算法-Code CShap Bubble Sort, Selection Sort, Insertion Sort, Hill sorting algorithm
- 2022-03-23 02:49:27下载
- 积分：1
-
多个Huffman编码、解码器的程序，对数据结构的学习者很有用。...
多个Huffman编码、解码器的程序，对数据结构的学习者很有用。-over Huffman encoding, decoding device procedures, data structures useful to learners.
- 2022-05-16 18:08:34下载
- 积分：1
-
在机票预订系统项目的前一阶段，这是一个总结…
在本机票预定系统项目的前一阶段，也就是概要设计阶段中，已经将系统用户对本系统的子模块功能做了详细的阐述，这些模块功能具体设计将在本报告中详尽得以叙述及阐明。
本阶段已在系统的概要设计的基础上，对机票预定系统做详细设计。主要解决了实现该系统程序模块具体设计问题。包括确定算法，数据结构，模块接口的使用，数据库的动态操作以及界面设计等。在以下的概要设计报告中将对在本阶段中对系统所做的所有详细设计进行详细的说明。
-In the ticket reservation system project in the previous phase, which is a summary of the design phase, the system user has a subset of the system modules have done a detailed, specific design features of these modules will be detailed in this report can be described and explained . This phase of the outline design of system based on air ticket reservation system do the detailed design. The main solution to the achievement of specific program modules of the system design issues. Including the identification of algorithms, data structure, the use of module interfaces, databases, dynamic operation, as well as interface design. In the following report will outline the design at this stage of the system has done all the detailed design detail.
- 2022-05-10 20:51:54下载
- 积分：1
-
Fibonacci函数
Fibonacci函数-Fibonacci function
- 2022-10-08 18:05:02下载
- 积分：1
-
这个程序是按照离散数学教材上给出的算法写的，是字典序的全排列算法。空间复杂度是O(n)，时间复杂度基本上是O(n^2)。缺点是只用于打印并没有储存所有的结果。...
这个程序是按照离散数学教材上给出的算法写的，是字典序的全排列算法。空间复杂度是O(n)，时间复杂度基本上是O(n^2)。缺点是只用于打印并没有储存所有的结果。-the procedure is in accordance with the materials on discrete mathematics algorithm is written, is a wholly-lexicographic order algorithm. Space complexity is O (n), is basically time complexity is O (n ^ 2). Only drawback is not for print, and store all the results.
- 2023-07-28 06:00:02下载
- 积分：1
-
多项式总和的链表数据结构
数据结构中的链表类实现多项式的相加 用C++实现!-Linked list data structure in the sum of polynomial-type implementation with C++ implementation!
- 2022-08-24 18:03:49下载
- 积分：1
-
0 / 1背包问题的几种解决方案，包括回溯，动态规划…
0/1背包问题的几种解法，包括回溯法、动态规划法以及穷举法。另外还包括集中方法的一个测试报告。-0/1 knapsack problem several solutions, including backtracking, dynamic programming method and the exhaustive method. It also includes a focus on methods of test reports.
- 2022-08-04 06:47:07下载
- 积分：1
-
1.[问题描述]
编写递归算法，计算二叉树中叶子结点的数目
[输入]
按照先序序列的顺序输入该结点的内容。其输入abd eh cf i g ....
1.[问题描述]
编写递归算法，计算二叉树中叶子结点的数目
[输入]
按照先序序列的顺序输入该结点的内容。其输入abd eh cf i g .
[输出]
按中序序列输出，输出的结果为；dbheaficg并计算出二叉树中叶子结点的数目为4
[存储结构]
采用二叉表存储
[算法的基本思想]
采用递归方法建立和遍历二叉树。首先建立二叉树的根结点，然后建立其左右子树，直到空子树为止，中序遍历二叉树时，先遍厉左子树，后遍厉右子树，最后访问根结点。根据左右子树的最后一个结点计算出二叉树中叶子结点的数目。
程序如下：
#include
#include
#include"stdlib.h" -1. [Description of the issue] to prepare recursive algorithm, Binary calculation leaves the number of nodes [imported] in accordance with the first order input sequence in the order of the node contents. Input abd eh i g cf. [Output] by the order sequence output, the results of the output; dbheaficg calculated Binary leaf node to the number four [storage structure] Table 2 forks storage [ The basic idea algorithm] recursive method and traverse binary tree. First established binary tree root node, and then to build their son around the tree, the tree until the loopholes, which preorder binary tree, Li first times the left sub-tree, right af
- 2023-08-31 16:00:04下载
- 积分：1
