linear list

This method is different from the feature Function and Linear list representing method .

该方法不同于特征函数法和线性表表示方法。

The Realization of the Linear List in Visual Basic

线性表在VISUALBASIC中的实现

An Improved Algorithm of Association Rules Based on Linear List

一种基于线性链表的关联规则改进算法

Discussion on the Linked Storage Structure of Linear List

线性表链式存储结构探讨

Zero in Linear List : Problem and Solution

关于线性表的零问题及其解决

The Discussion on the Algorithm in Double Chained Linear List With First Node

带头结点的双向链表算法讨论

Quick Search of Linear List Using Sherwood Algorithm

利用舍伍德算法实现线性表的快速查找

Designing of Polymorphic Linear List

多态线性表的设计

An object-oriented approach is used for data modeling in this paper , The simple object is defined as a named linear list .

采用面向对象的方法构造数据模型，把命名的线性表定义为简单对象。

GA programming algorithm is put forwarded . The expression of solution is changed from tree-structure to linear list .

将GP算法解的树型结构转换为线性表结构，提出GA规划算法。

Linked list is a kind of common data structure in microcontroller 's program , which includes stack , queue and linear list .

链表是单片机程序开发中一种常见的数据结构，通常包括栈链、队列和线性链表。

This article classified particularly the linked storage structure of linear list , and partly supplies the basic operations and the correlated algorithm .

本文对线性表的链式存储结构进行了较为详细的探讨，并给出了部分基本操作和相关算法。

However , the famous search engines such as Google , Baidu return results to the user in the form of a linear list .

但是，著名的搜索引擎如Google、百度等，为用户返回的结果均为线性列表的形式，毫无规律的罗列在一起。

This thesis started from basic idea if inserting element and deleting element from linked storage of linear list , differently giving the algorithm idea for implementation of the operation .

从线性表的链式存储下元素的插入与删除的基本思想出发，分别给出了操作实现的算法思想。

The first potential future change would modify the unacknowledged packet list so that it is organized with an index as a red-black tree instead of the current linear list .

第一个可能的未来改变是对未应答的包列表进行修改，因此包列表的组织形式不再是当前的线性列表而是通过索引组织成红-黑树。

Because the data which belong to dynamic data field have the characteristics that operations of inserting and deleting are frequent , a structure which combines linear list and link list is proposed to reduce time complexity .

根据动态数据域插入删除操作频繁的特点，采用线性表与链表相结合的结构，以降低其频繁更新操作和实时查询操作的时间复杂度。

Compared with other DMMs , first fit DMM using address-ordered linear list data structure is the most researched and applied , since it tends to enhance program locality , and causes significantly less fragmentation .

在理论研究和实际应用中，按地址有序首次匹配线性表结构的DMM由于其有利于增强程序局部性，显著地减少内存碎片，因而得到广泛的关注。

Analysis of Inserting Element and Deleting Element in Linear Linked List

线性链表插入元素与删除元素算法的分析

According to the structural characteristics of polynomial , linear linked list to achieve the polynomial are added storage nodes of the coefficient and index , constructed the corresponding polynomial .

根据多项式的结构特点，利用线性链表来实现多项式相加，结点中存放各项的系数和指数，构造相应的多项式。

This paper sets forth an idea of algorithm design that while an unorder linear - list is accesed , dynamically , gradually ordering be complete , and take two typical algorithm analyzed its feasibility and property .

阐述了在对无序线性表进行访问的同时，动态地逐步完成排序的算法设计思想，并以两种典型的算法分析了其可行性及性能。

These techniques are transformation algorithm from linear to connective list notation for molecular representation , division of molecular structure , judgment method of molecular identity , calculation of molecular similarity , backward inference to predict reactions by model match , ring structure recognization and structure match method .

其中包括：从线型到连接表表示的转换算法，对分子结构、分子结构同构判别法及相似度计算；除向前推理方法外，还增加了向后推理的方法；