-
KMP---MFC
数据结构里面的KMP算法的可视化演示程序 MFC实现(Visualization of data structures inside the KMP algorithm demo program MFC implementation)
- 2020-07-04 08:40:01下载
- 积分：1
-
005
c++ data struct stack
- 2012-03-01 14:24:42下载
- 积分：1
-
48qqqq
主要用栈和树求解骑士问题，用C++语言编写的(The main stack and tree Cavalier Problem Solving with C++ languages)
- 2009-03-21 22:34:39下载
- 积分：1
-
mifeng
c语言平时作业练习，包括输入输出，数组，链表等
c语言平时作业练习，包括输入输出，数组，链表等(output mifengoutput mifengoutput mifengoutput mifengoutput mifengoutput mifengoutput mifengoutput mifengoutput mifeng)
- 2014-04-28 16:01:53下载
- 积分：1
-
Data-Structure11-15
本书是关于计算机科学与工程领域的基础性研究科目之一——数据结构与算法的专著。 本书在简要回顾了基本的C++ 程序设计概念的基础上，全面系统地介绍了队列、堆栈、树、图等基本数据结构，以及贪婪算法、分而治之算法、分枝定界算法等多种算法设计方法，为数据结构与算法的继续学习和研究奠定了一个坚实的基础。更为可贵的是，本书不仅仅介绍了理论知识，还提供了50多个应用实例及600多道练习题。 本书内容广博权威，结构清晰合理，是一本全新的有关数据结构与算法的教材，对于计算机科学与工程领域的从业人员也是一本很好的参考书。 11-15章
(This book is about the field of computer science and engineering subjects of basic research- data structures and algorithms monographs. In a brief review of the book based on the basic concept of C++ programming on a comprehensive and systematic introduction to the queues, stacks, trees, graphs and other basic data structures, and the greedy algorithm, a variety of algorithms divide and conquer algorithms, branch and bound algorithm design method for data structures and algorithms continue to learn and study laid a solid foundation. More valuable is the book not only theoretical knowledge, but also provides more than 50 application examples and more than 600 channel exercises. Book a broad authority, clear and reasonable structure, is a new data structures and algorithms related materials, for the field of computer science and engineering practitioners also a good reference book. Chapter 11-15)
- 2014-05-30 09:27:46下载
- 积分：1
-
LINK
建立链表的算法：
新节点链入表尾建立链表：
动态分配第一个节点变量；
用指针head 妥善保存链表第一个节点的地址值；
依次动态分配一个新节点变量；
将上一个节点的指针域指向新生成的节点；
循环3),4)步骤，直到所有节点均连入链表；
将最后一个节点的指针域赋值为0；
(Establish the list of algorithms:
The new node links footer build list:
Dynamic allocation of the first node variable
Keep the list head pointer of the first node address value
In order to dynamically allocate a new node variable
The domain of a node pointer to the new generation of nodes
Cycle 3), 4) step, until all nodes are connected to the chain
Pointer field will last node assigned to 0 )
- 2015-01-05 16:03:48下载
- 积分：1
-
FIFO-c
说明： 操作系统先来先服务调度算法模拟（C描述）(Operating a first-come first-served scheduling simulation (C description))
- 2010-04-13 00:02:35下载
- 积分：1
-
hamidunp2Boulatu
关于中国邮递员的解决办法，个人觉得还不错的说(Chinese postman)
- 2012-06-10 17:28:15下载
- 积分：1
-
8_queen
8_queen问题的一个自创的算法，还不错！(8_queen)
- 2009-10-21 11:49:24下载
- 积分：1
-
d
有助于c++的初学者在平日的学习中更好的学习(Contribute to better learning c++ beginners learning on weekdays)
- 2013-11-29 14:32:18下载
- 积分：1
