搜索资源列表
orangeaug1802
- 具体说明了如何通过双向链表对期货交易中的有关数据进行组织和管理,从而实现内存撮合,提高交易系统的响应速度.
Student V1_0
- 这个个系统是学生管理系统。利用SDK做界面，用双向链表做排序，功能简单，但是思路清晰，有不到指出多原谅-systems is the Student Management System. Do use SDK interface, so with two-way linked list, in order of functions simple, but clear ideas that are not more forgiving
双向循环链表使用实例.zip
- 双链表的应用
b
- 已知一个双向链表，从第二个元素开始已经呈递增有序，请编写一个算法把第一个元素删除且插入到适当位置，结果链表仍然有序（设表无头结点） 主要是定义一个双向链表，随意输入几个数字，把第一个数字插进去，条件的是呈递增有序，把第一个元素删除！ -Known to a two-way list, from the beginning of the second element has been increasing in an orderly manner, write an algorithm
a
- 有双向循环链表结点定义为： struct node { int data struct node *front,*next } 有两个双向循环链表A，B，知道其头指针为：pHeadA,pHeadB，请写一函数将两链表中data值相同的结点删除，并测试。-Two-way linked list node cycle defined as: struct node (int data struct node* front,* next ) there are two t
double-line
- 双向链表的编写方法 循环链表是与单链表一样，是一种链式的存储结构，所不同的是，循环链表的最后一个结点的指针是指向该循环链表的第一个结点或者表头结点，从而构成一个环形的链。-Doubly linked circular list is a compilation of the single list, is a chain of storage structure, the difference is the last circular list node pointer is point
Menu-window-using-C-language-
- 双向链表制作的通讯录源程序， 有交互性 有完整注释 有一定难度-Doubly linked list making contacts source, interactive complete notes there is a certain degree of difficulty
shuangxianglianbiao
- 通讯信息管理 双向链表制作的通讯录源程序-Contacts the source of the doubly linked list made in communications and information management
doublelinklit
- 这时双向链表的C++实现，里面定义了一个链表类。含有丰富的成员函数。比如：拷贝构造函数，析构函数，插入函数，删除函数，排序函数等等。总之，里面的函数肯定够你用的。-At this time, two-way linked list C++ achieved, which defines a linked list class. Rich in member function. Example: copy constructor, destructor, insert function, dele
double-way-link-list
- 建立带头结点的双向循环链表L，插入，删除，逆置-double-way linked-list representation and implementation
programmers-face-questions-
- 面试精选，把二元查找树转变成排序的双向链表-Interview selection, the binary search tree into a doubly linked list sorted
dlist
- 一个简单的双向链表的建立、实现简单功能的C++的源代码，希望可以帮助大家-A simple two-way linked list creation, simple functions C++ of the source code, I hope you can help
kernel_list_and_hash_table.tar
- Linux 内核的实现,大量使用了数据结构,包括了数组、链表和散列表。其中用的最多的是双向循环链表。 Linux 内核使用的是自己定义的链表和散列表,简单而高效,使用方法也非常的别具一格。-Implementation of Linux core, the extensive use of data structures, including arrays, linked lists and hash table. The most widely used is the double circu
doubly-linked-list
- 双向链表能够双向循环，具备查找、添加、删除等多种功能。-Capable of two-way circular doubly linked list, with search, add, delete, and other features.
Two-way-linked-list-data-structure
- 利用链式存储结构存储学生的成绩信息，定义学生结构体类型，建立双向循环链表-The chain store structure is used to store the students performance information, and to define the structure of the students, and to establish a two-way circular linked list.
linkedList
- C++双向链表实现，数据结构的入门代码。-c++ source of linked list.
stack2
- 双向链表的实现，通过类实现，同时由链表的删除创建等。-Doubly linked list implementation, realized through the class, while the list of deleted to create the like.