-
B_Tree
B-树的创建、插入、删除等一系列操作！(B-tree creation, insert, delete a series of manipulations!)
- 2020-10-18 18:17:26下载
- 积分：1
-
strcon
对于给定的n个字符串，请找出一种最佳的连接方式，使得采用该连接方式得到的字符串在所有连接的结果中，字典序最小(For a given n-string, find an optimal connection, making use of the connection string to get the results in all connections, the lexicographic minimum)
- 2011-09-02 16:52:40下载
- 积分：1
-
pinfanfangwen
设有一头指针为L的带有表头结点的非循环双向链表，其每个结点中除有prev（前驱指针），data（数据）和next（后继指针）域外，还有一个访问频度域freq。在链表被起用前，其值均初始化为零。每当在链表中进行一次Locate(L,x)运算时，令元素值为x的结点中freq域的值增1，并使此链表中结点保持按访问频度非增（递减）的顺序排列，同时最近访问的结点排在频度相同的结点的最后，以便使频繁访问的结点总是靠近表头。试编写符合上述要求的Locate(L,x)运算的算法，该运算为函数过程，返回找到结点的地址，类型为指针型。(Has a head pointer is non-circular doubly linked list L with a header node, each node in addition to prev (precursor pointer), data (data) and next (successor pointers) outside, there is an access frequency degree domain freq. Before the list was hired, their values are initialized to zero. Whenever carried out in the list once Locate (L, x) when the operation, so that the element node x is the value in freq domain by one, and keep this list in the node-access frequency of non-increasing (decreasing) the order, while a recent visit to the nodes in the same row of the frequency of the last node, so that the nodes are frequently accessed tables are always near the head. Locate (L, x) algorithm is prepared in accordance with the above requirements of the test operation, the operation as a function of the process, return to find the address of the node of type pointer.)
- 2015-01-15 22:31:59下载
- 积分：1
-
Z
说明： 在给定的字母中，用c++来实现字母的排序(In a given letter, the use of c++ to implement the letter of the sort)
- 2010-06-29 21:59:50下载
- 积分：1
-
b-trees
① 实现在B-树上的查找，并分析其时间复杂性。
② 实现B-树的ADT，包括其上的基本操作：结点的加入和删除。
③ 要求B-树结构中的M=3 或5，实现其中的一种即可。
④ 实现基本操作的演示。
(4) 实现提示
(b-trees c/c++)
- 2021-01-20 09:48:41下载
- 积分：1
-
m-in
说明： 数据隐私保护K-匿名问题的动态多次发布类似m-invarience算法(Data Privacy Protection K-anonymity problem on many occasions issued a similar dynamic m-invarience algorithm)
- 2008-09-25 08:06:33下载
- 积分：1
-
3.4.6
单链表中的数据元素含有三种字符（字母、数字、其他字符），算法实现构造三个循环链表，是每个循环链表中只含有同一类字符，且利用原表中的结点空间作为这三个表的结点空间。(Singly linked lists of data element contains three characters (letters, Numbers and other characters), the algorithm constructs three circular linked list, each cycle list contains only the same type of character, and make use of the primary node space in a table as a node of the three table space.)
- 2014-04-15 13:11:37下载
- 积分：1
-
NoGo
计算机博弈大赛不围棋的代码 个人所写，可以用来参考( U8BA1 u7B97 u673A u535A u5F08 u5927 u8D5B u4E0D u56F4 u68CB u7684 u4EE3 u7801 u4E2A u4EBA u6240 u5199 uFF0C u53EF u4EE5 u7528 u6765 u53C2 u8003)
- 2021-04-04 19:39:04下载
- 积分：1
-
bag1
使用不同的方法解决背包问题：本算法采用的是动态规划方法，比较好的解决背包问题。(Use different methods to solve knapsack problem: The algorithm is a dynamic programming approach, a better solution to knapsack problem.)
- 2011-07-16 18:40:31下载
- 积分：1
-
Tetris
使用很好的数据结构，程序运行效率高，界面简洁美观。(Good data structure, high efficiency, simple and beautiful interface.)
- 2013-03-27 10:51:16下载
- 积分：1
