Title :
Algorithm Description of Generalized Binary Linked List
Author :
Chen, Haishan ; Chen, Yu ; Wang, Beizhan ; Long, Fei
Author_Institution :
Xiamem Univ., Xiamen
Abstract :
Based on the ADT (abstract data type) definition, characteristics and storage structure of generalized list a new representation called GBLL (generalized binary linked list) is proposed. The purpose of GBLL is to improve generalized list in its application areas. A few algorithms of GBLL and the analyses of their complexities are provided. In order to reduce the runtime memory consumption and increase the execution efficiency, non-recursive algorithms are used most of time.
Keywords :
computational complexity; data structures; abstract data type; algorithm description; computational complexity; execution efficiency; generalized binary linked list; nonrecursive algorithm; runtime memory consumption; storage structure; Algorithm design and analysis; Data processing; Data structures; Education; File systems; Information science; Large-scale systems; Magnetic heads; Postal services; Runtime; algorithm design; generalized binary linked list; generalized list; linked storage representation;
Conference_Titel :
Networking, Sensing and Control, 2008. ICNSC 2008. IEEE International Conference on
Conference_Location :
Sanya
Print_ISBN :
978-1-4244-1685-1
Electronic_ISBN :
978-1-4244-1686-8
DOI :
10.1109/ICNSC.2008.4525496
