-
这是一个不错的数据库管理程序
这是一个不错的数据库管理程序-This is a good database management procedures
- 2022-01-30 23:54:59下载
- 积分：1
-
determinnant在生成TR编码
determinnant coding in spaning tr-determinnant coding in spaning tree
- 2023-09-06 00:30:03下载
- 积分：1
-
Graduate management systems: divided into six modules: authentication modules, g...
毕业生管理系统:分为六个模块：身份验证模块、毕业生资料模块,考试成绩录入模块、通信录及数据输出与系统设置模块、毕业生成绩统计模块、数据库维护模块。-Graduate management systems: divided into six modules: authentication modules, graduates of information modules, examination results entry module, communications were recorded and the data output and system settings module, graduates accomplishments statistics module, database maintenance module.
- 2022-03-24 18:17:20下载
- 积分：1
-
JAVA密码保护页面
JAVA密码保护页面-password-protected pages JAVA
- 2022-02-05 01:48:38下载
- 积分：1
-
物资管理系统
物资管理系统-VC 使用ADO实现-Material Management System-VC use ADO
- 2023-02-01 06:45:04下载
- 积分：1
-
问题描述：假设一个商店，有一个架子和一个仓库，当第…
问题描述： 假设一个商店，它有一个货架和一个仓库，当货架上的商品数量少于一定的数目时，从仓库运一定数量的商品摆到货架上，当仓库里的商品的数量少于一定的数目时，购买商品把仓库填满，商品的出售要按照商品的生产日期来，快要过期的商品要先出售。 解决问题的方法： 用了两个栈和 一个队列，把队列当作仓库，用一个栈作为货架，把另一个栈当作临时的存储箱。当要往货架上添商品时，先把作为货架的栈中的元素全都压到作为存储箱的栈中，再把仓库中的元素压到存储箱中，然后再把存储箱中的所有元素都压到货架上，这样，就能保证快要过期的商品先被出售。-Problem description : Suppose a shop, which has a shelf and a warehouse, when the merchandise on the shelves less than a certain quantity of the number, a certain number from the warehouses of goods on the shelves, when the warehouse volume of goods is less than certain number, purchase goods warehouse filled, the goods according to the sale of commodity production to date, is about to expire first sale of goods. The solution : a two stack and a queue, queue as a warehouse, used as a stack shelves, and another stack as a temporary storage bins. When to go to the shelves Tim commodity, first as a stack shelves of all elements of the pressure storage tank as the stack, then the warehouse down to the storage element box, and then s
- 2022-07-13 01:56:00下载
- 积分：1
-
[问题描述]
将N个关键字去整数的记录进行整序， 以使所有关键字为非负数的记录排在关键字为负数的记录之前，要求使用最少的附加空间，且算法的时间复杂度为O（N...
[问题描述]
将N个关键字去整数的记录进行整序， 以使所有关键字为非负数的记录排在关键字为负数的记录之前，要求使用最少的附加空间，且算法的时间复杂度为O（N）
[输入]
待排序记录个数，各关键字的值。
[输出]
关键字从正负分开，正数在前
[存储结构]
待排序记录顺序存储。
[算法的基本思想]
快速排序算法每次任取一个记录的关键字为标准，将其余记录分为两组将，N个关键字去整数的记录进行整序， 以使所有关键字为非负数的记录排在关键字为负数的记录之前。
#include
using namespace std
#define MAXNUM 100//设文件的最长可能长度
void sort(int* keys, const int len)//排序
-[Problem Description] N keyword to the integer sequence the entire record. keyword so that all non-negative Records with the keyword for the negative record, at least require the use of the additional space and time complexity of the algorithm is O (N) [imported] to be sort record number, The value of the keyword. [Output] keyword separate from the pluses and minuses are several former [storage structure] scheduling records to be stored sequence. [Algorithm for the basic idea] quick sort algorithm each time a record for any keyword as a standard, The remaining records will be divided into two groups, N-keyword
- 2022-03-17 21:15:57下载
- 积分：1
-
医院管理
登录
- 2022-03-22 14:17:18下载
- 积分：1
-
c achieve the AOV
c++下的AOV实现-c achieve the AOV
- 2022-10-30 09:00:03下载
- 积分：1
-
introduced a total of four ranking functions : insertion sort, bubble sort, sele...
书中共介绍了四类排序函数：插入排序、起泡排序、选择排序、快速排序。我们需要建立一个无序随机序列，分别用上述排序方法对建立的无序序列有序化，编写相应的程序计算每种算法的赋值次数、比较次数以及所用时间，以此为依据来判断各种算法的效率。-introduced a total of four ranking functions : insertion sort, bubble sort, select, in order of Quick Sort. We need to build a disorderly random sequence, the use of such methods of sequencing to establish an orderly sequence of the disorder, and the preparation of the corresponding procedures of each algorithm for the calculation of frequency assignment, as well as comparison with the number of time, using this as the basis to judge the efficiency of algorithms.
- 2023-05-03 00:20:03下载
- 积分：1
