High Impact Factor : 4.396 icon | Submit Manuscript Online icon |

The SC Linked List - An Alternative Approach of the Linked List Data Structure

Author(s):

Prateek Agrawal , SYMBIOSIS INSTITUTE OF TECHNOLOGY

Keywords:

Linked Lists, Algorithm, Time Complexity, Space Complexity

Abstract

Utilizing doubly linked list rundown in inserted frameworks or embedded system can be costly. Albeit doubly connected is productive as far as time multifaceted nature and very adaptable in itself, empowering simple traversal and refresh, yet it frequently requests more memory space contrasted with other rundown information structure – this is because of the space required for the additional pointers, multiplying the sum required for a separately connected rundown. In this paper, we present the S-connected rundown – a half and half of the idea of the independently connected rundown and the round connected rundown. The half and half gives an information structure that is like the unrolled connected rundown, but instead than have a cluster in every hub, we have a separately connected rundown. An examination of the space unpredictability and asymptotic time multifaceted nature of the calculation was completed.

Other Details

Paper ID: IJSRDV7I20272
Published in: Volume : 7, Issue : 2
Publication Date: 01/05/2019
Page(s): 2078-2081

Article Preview

Download Article