One small step for a man
One Giant leap for the mankind

There is no wealth like Knowledge
                            No Poverty like Ignorance
Journal of Emerging Trends in Computing and Information Sciences Logo

Journal of Emerging Trends in Computing and Information Sciences >> Call for Papers Vol. 8 No. 3, March 2017

Journal of Emerging Trends in Computing and Information Sciences

The S-Linked List – A Variant Of The Linked List Data Structure

Full Text Pdf Pdf
Author Akinde Aderonke O., Okolie Samuel O., Kuyoro ‘Shade O.
ISSN 2079-8407
On Pages 571-576
Volume No. 4
Issue No. 6
Issue Date July 01, 2013
Publishing Date July 01, 2013
Keywords Linked lists, Algorithm, Time Complexity, Space Complexity


Abstract

Using doubly linked list in embedded systems can be expensive. Although doubly linked is efficient in terms of time complexity and highly flexible in itself, enabling easy traversal and update, but it often demands more memory space compared to other list data strucure – this is as a result of the space required for the extra pointers, doubling the amount needed for a singly linked list. In this paper, we introduce the S-linked list – a hybrid of the concept of the singly linked list and the circular linked list. The hybrid gives a data structure that is similar to the unrolled linked list, but rather than have an array in each node, we have a singly linked list. An analysis of the space complexity and assymptotic time complexity of the algorithm was carried out.
Back

Seperator
    Journal of Computing | Call for Papers (CFP) | Journal Blog | Journal of Systems and Software | ARPN Journal of Science and Technology | International Journal of Health and Medical Sciences | International Journal of Economics, Finance and Management     
Copyrights
© 2015 Journal of Computing