-
jgctgu
流水线车间的零件加工排序问题，以达到最优的加工顺序，使加工时间最短或零件后期维护费用最少(Plant parts processing pipeline scheduling problem, in order to achieve optimal machining sequence, so that the processing time of the shortest or least parts later maintenance costs)
- 2014-05-08 01:12:54下载
- 积分：1
-
Online_RandMarkingAlgorithm
本程序解决的是：模拟类似计算机主、缓存的存储结构，当用户请求某个页面时，若某个页面已在缓存中，则直接从缓存中去取，不会产生失误（即未在缓存中命中），否则，就到主存中去取，代价变大。
本程序采用随机标记算法，即在在线标记算法的基础上，对于替换页面时，采用随机从未标记的缓存项中选出一项进行替换。
代码、文档详尽(Addressed in this program are: analog computer-like main, cache storage structure, when the user requests a page, a page in the cache directly from the cache to fetch, does not produce errors (that is, not in the cache in the hit), otherwise, to the main memory to fetch a consideration of larger. This program uses a random marking algorithm, online marking algorithm based on random never mark the cache entry selected a replacement for the replacement page. Code, documentation detailed)
- 2012-09-19 13:01:47下载
- 积分：1
-
yuesefuhuan
使用VC编写的约瑟夫环程序，简单明了，方便使用(Prepared using the VC Joseph Central program, simple and clear, easy to use)
- 2009-09-08 16:45:26下载
- 积分：1
-
test
使用vc编写的一个动态链接库，测试动态链接库的例程(Vc prepared using a dynamic link library, dynamic link library routine testing)
- 2010-05-28 23:27:09下载
- 积分：1
-
RBtree
使用C++/C语言实现的红黑树，对于数据结构的学习有所帮助。(Use red-black tree C++/C language for learning data structures helpful.)
- 2014-05-16 16:09:57下载
- 积分：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
-
KD-tree
kd-树（k维搜索树）是把二叉搜索树推广到多维数据的一种主存数据结构。这里给出了其代码的VC++实现(Classic data structures- KD tree full implementation, with a detailed explanation of the code, the novice data structure good materials)
- 2013-05-10 11:03:53下载
- 积分：1
-
c-language-book
C常用算法程序集，一些C语言的基本算法在里面都可以找到。(this is a very good book about c language,you will find it is very useful in your work.)
- 2011-12-14 23:01:04下载
- 积分：1
-
delete
数据结构 实验练习 删除相同的节点 希望会对大家有所帮助(Data structures lab exercises to remove the same node want to be helpful to everyone)
- 2012-11-14 12:59:15下载
- 积分：1
-
QuickSort
快速排序，用数组的存储结构，实现数的排序。共有八组随机数据，还能够计算出每组数据的处理时间，最终得到平均时间。(Quicksort array storage structure, to achieve the sort of number. A total of eight sets of random data, but also be able to calculate the processing time of each data, and eventually obtain the average time.)
- 2013-03-22 21:21:16下载
- 积分：1
