-
这个算法，是用来设置密码的，有数据结构中的栈来实现的。...
这个算法，是用来设置密码的，有数据结构中的栈来实现的。-The algorithm is used to set up passwords, and data structure of the stack to achieve.
- 2022-03-14 20:06:25下载
- 积分：1
-
这是一个简单的数据库管理系统。它不使用任何其他的代码（即外径…
This a simple database management system. It doesn t use any other code (i.e. ODBC, ADO, etc.) and has it s own database file format. I wrote it because I found the other DBMSs code too bulky and hard to debug. It s designed for small applications and I doubt it could handle anything on a large scale. A sample program included in the .zip shows how everything works. The database project is a library project, so you ll have to compile and link with the .lib file to get everything working. Pros: - You have the source code so you know exactly what it is doing - Database files are very small - Small and fast code Cons: - Can t handle large amounts of records (more than 65000ish) - Doesn t support SQL (you have to search the database by cycling through the records and testing them against your constraints) - Each database file can only have one table.
-This a simple database management system. It doesn t use any other code (i.e. ODBC, ADO, etc.) and has it s own database file format. I wr
- 2022-04-20 06:29:24下载
- 积分：1
-
一个效率还可以的配对堆
Fibonacci Heap太难写了
配对堆可以有效替代Fibonacci Heap
附带了用它实现的Dijkstra...
一个效率还可以的配对堆
Fibonacci Heap太难写了
配对堆可以有效替代Fibonacci Heap
附带了用它实现的Dijkstra
复杂度O(nlogn+e)
-An efficient matching can also be hard to heap Fibonacci Heap wrote a pairing heap Fibonacci Heap can be an effective alternative to use it comes with the realization of Dijkstra complexity O (nlogn+ E)
- 2022-06-13 04:20:15下载
- 积分：1
-
哈夫曼树算法
根据给定的n个权值{w1,w2,……wn}，构造n棵只有根结点的二叉树，令起权值为wj
在森林中选取两棵根结点权值最小的树作左右子树，构造...
哈夫曼树算法
根据给定的n个权值{w1,w2,……wn}，构造n棵只有根结点的二叉树，令起权值为wj
在森林中选取两棵根结点权值最小的树作左右子树，构造一棵新的二叉树，置新二叉树根结点权值为其左右子树根结点权值之和
在森林中删除这两棵树，同时将新得到的二叉树加入森林中
重复上述两步，直到只含一棵树为止，这棵树即哈夫曼树
-Huffman tree algorithm based on a given n-weights (w1, w2, ... ... wn), construct n trees only a root node of the tree, so that from the right value of wj in the forest root node to select two the right tree for the value of the smallest subtree around, a new binary tree structure, the right to buy a new tree root node value of its subtree root node around the right value in the forest and delete these two trees, At the same time, the new binary tree obtained by adding the forest to repeat the above two steps until a tree containing only the date, that is, Huffman tree tree
- 2023-05-05 13:05:03下载
- 积分：1
-
realization of the Polish
实现了波兰式的求解，对大数计算使用，可以到100位数的运算-realization of the Polish-solving, the use of large numbers calculation, the median of 100 Operators
- 2022-06-11 15:17:39下载
- 积分：1
-
IOI 2001 解题报告
内容：所有题目的详细分析以及参考程序
此外还有Ｔｅｓｔ数据...
IOI 2001 解题报告
内容：所有题目的详细分析以及参考程序
此外还有Ｔｅｓｔ数据-IOI 2001 Solving the contents of the report: a detailed analysis of all the topics and make reference to procedures in addition to Test Data
- 2022-11-30 22:45:03下载
- 积分：1
-
data algorithm, the cooler East problem
数据算法，凉东问题-data algorithm, the cooler East problem
- 2022-03-15 23:25:10下载
- 积分：1
-
引用枕善居网站上的职工工资系统，分享给大家
引用枕善居网站上的职工工资系统，分享给大家-Habitat Pillow cited good wages for workers on the site system, and share with everyone
- 2022-01-26 04:09:01下载
- 积分：1
-
own definition of an array overpack, which is a "user
一个自己定义的数组外包装，这是“使用者自定义stl容器“的一个好例子，在数组之外包装了一层常用的容器界面。-own definition of an array overpack, which is a "user-defined stl containers" of a good example In addition to the array of packaging containers used layer interface.
- 2022-04-18 12:19:28下载
- 积分：1
-
项目描述: SQLite is a small C library that implements a self
项目描述: SQLite is a small C library that implements a self-contained, embeddable, zero-configuration SQL database engine. Features include- Project description: SQLite is a small C library that
implements a self-contained, embeddable, zero-configuration SQL
database engine. Features include
- 2022-01-22 13:40:01下载
- 积分：1
