-
eightqueen
利用數據結構中的棧，實現19世紀著名數學家高斯提出的八皇后問題(Stack data structure, to achieve the eight queens problem of the 19th century, the famous mathematician Gauss)
- 2012-10-23 08:30:21下载
- 积分：1
-
baiji
百鸡算法是一种简单的逻辑算法，通过不同的鸡不同的价钱，得出大鸡小鸡的个数(Typical code for white chicken algorithm)
- 2012-06-02 16:31:30下载
- 积分：1
-
courseDesign
C语言课程设计例子，迷宫的实现，包括了需求分析，概要设计，详细设计，测试，源代码等(C language curriculum design example, the realization of the maze, including requirements analysis, preliminary design, detailed design, testing, source code, etc.)
- 2011-11-23 23:41:04下载
- 积分：1
-
2
说明： 用链表的方式实现多项式的加减，其中结构体包含幂次和系数。(Polynomial addition and subtraction with a list of ways in which the structure and contains the power of coefficients.)
- 2017-03-10 09:10:31下载
- 积分：1
-
delete
数据结构 实验练习 删除相同的节点 希望会对大家有所帮助(Data structures lab exercises to remove the same node want to be helpful to everyone)
- 2012-11-14 12:59:15下载
- 积分：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
-
cPP
数据结构课设，城市地铁站的设计与使用规划(Set data structure class, subway station design and use of planning)
- 2011-07-03 11:58:24下载
- 积分：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
-
yuesefu
约瑟夫问题，通过C语言对约瑟夫问题进行了分析和讲解，从而解决问题(Joseph problems, by Joseph C language issues are analyzed and explained, in order to solve the problem)
- 2011-10-26 10:56:33下载
- 积分：1
-
improvedKMPalgorithm
大学计算机专业，数据结构中的改进的KMP算法，C++编写。(University computer science, data structures to improve the KMP algorithm, C++ written.)
- 2010-05-24 12:45:20下载
- 积分：1
