-
LCS
the longest common serials
- 2011-12-13 00:32:40下载
- 积分：1
-
bstree_frame
利用二叉平衡树进行数据排序。这里采用的数据结构是指针。(The use of balanced binary tree sort the data. The data structure used here is a pointer.)
- 2013-08-10 16:43:50下载
- 积分：1
-
d
有助于c++的初学者在平日的学习中更好的学习(Contribute to better learning c++ beginners learning on weekdays)
- 2013-11-29 14:32:18下载
- 积分：1
-
yinhangmoni
这是一个简单的银行模拟系统
1、 客户的到达时间随机
2、 客户需要处理的业务随机（不同业务处理的平均长度不同，例如：取款时间较短，开户和销户时间较长）
3、 处理客户业务所需时间随机（在一定范围内）
4、 使用文本文件记录每个客户到达时间、业务处理时间、业务结束时间
5、 动态显示（刷新时间可调）目前每个窗口累计处理客户数量、等待人数，每个窗口的平均业务处理时间，不同业务类型业务的累计办理量。
(This is a simple bank simulation system
1 customer arrival time random
2, customers need to deal with the business of random (the average length of the different business processes, such as: the withdrawal shorter, longer to open an account and cancel the account)
3, the time required to deal with customer service random (within certain limits)
4, using a text file to record each customer arrival time, business processing time, the business end of time
5 dynamically display (refresh time is adjustable) each window is accumulated to handle the number of customers waiting for the number the average business processing time of each window, different type of business operations total for the amount.)
- 2012-11-22 00:08:18下载
- 积分：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
-
xx
说明： 数据结构实验报告链表的操作，包括创建空链表、插入、删除节点等(Experimental Report list data structure operations, including creating an empty list, insert, delete nodes, etc.)
- 2009-11-25 08:36:26下载
- 积分：1
-
sy1.cpp
实验内容：
建立一个包含图书（书号，书名，定价）信息的的链表，并具有如下功能：
(1) 根据指定图书个数，逐个输入图书信息；
(2) 根据书名进行查找，返回此书的书号和定价；
(3) 根据指定的位置可返回相应的图书信息（书号，书名，定价）；
(4) 给定一个图书信息，插入到表中指定的位置；
(5) 删除指定位置的图书记录；
(6) 统计表中图书个数。
(It is a good c++.)
- 2012-10-26 15:23:15下载
- 积分：1
-
process_schedule
演示进程调度算法 使用的链表 包涵7个功能 4个算法(Process Scheduling Algorithm Demo
)
- 2011-12-24 10:52:17下载
- 积分：1
-
Set
使用C语言建立带头结点链表实现了集合。并进行了性能上的优化。(Achieve set using C to build list witch head node. And make optimization in performance.)
- 2009-11-18 13:29:05下载
- 积分：1
-
paixu
使用的排序算法，非常不错的思维，比较其他有较大优势(Sorting algorithm used, very good ideas, have greater advantages compared with other)
- 2009-05-05 17:54:54下载
- 积分：1
