Design and Implementation of Multiple Linked Lists Sharing the same Memory

Yong Ping Gao; Jun Zhang

doi:10.4028/www.scientific.net/AMR.706-708.1936

Paper Titles

The Design and Application of Quality Information Management System of the Assembly Line of Engine
p.1919

The Power Spectrum Estimation of the AR Model Based on Motor Imagery EEG
p.1923

The Spatial Classification Algorithm of K-Nearest Neighbor Based on Spatial Predicate
p.1928

Comprehensive Assessment Method of Equipment Support Exercise
p.1932

Design and Implementation of Multiple Linked Lists Sharing the same Memory
p.1936

Design of a Scene Federate in the Proving Ground Simulation Platform
p.1941

Digital Model Construction by Reverse Engineering Design Based on Geomagic Studio and Pro/E Software
p.1945

Equipment Support Training Level Evaluation Method based on ANFIS
p.1950

Meso-Scale Oriented Physical Simulation Model for Complex Product Maintenance in Virtual Environment
p.1954

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 706-708Design and Implementation of Multiple Linked Lists...

Design and Implementation of Multiple Linked Lists Sharing the same Memory

Abstract:

In some languages, because there is no pointer data type, so the single linked list is described by the use of the array. When there are multiple nodes of the same type list, these lists can share the same static linked list of memory, so it can mutually adjust the remaining places to reduce the overflow space. To solve practical problems, this paper is designed from the static linked list sharing the same storage space, the constructor, inserting operations, deleting operations, and it puts up forward a suggestion of its specific implementation and analyzes time complexity of algorithms and its significances.

You might also be interested in these eBooks

Mechatronics and Intelligent Materials III

View Preview

Info:

Periodical:

Advanced Materials Research (Volumes 706-708)

Pages:

1936-1940

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.706-708.1936

Citation:

Cite this paper

Online since:

June 2013

Authors:

Yong Ping Gao, Jun Zhang

Keywords:

Array, Delete, Insert, Share, Static Linked List, Time Complexity

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Xiao bo, Data Structure & STL[M], Beijing university of post and telecommunications press,2010,09.

Google Scholar

[2] Da Wen-jiao, The research of sort of static chain list [J], Automation & Instrumentation. 2011 (2) 12-14.

Google Scholar

[3] Yongping Gao, Shumin Zhou, Use Stack to Make the Non-recursion Algorithm of Bit Link Tree, Computer Era, No.11, 2005, pp.24-25.

Google Scholar

[4] Yong-ping Gao. Explore a New Way To Convert a Recursion Algorithm into a Non-recursion Algorithm, COMPUTER AND COMPUTING TECHNOLOGIES IN AGRICULTURE. 2008(01): 187-191

DOI: 10.1007/978-0-387-77251-6_21

Google Scholar