RIP Linked List

06/12/2023
by   Benoît Sonntag, et al.
0

Linked lists have always been an excellent teaching tool in programming.The question arises as to whether it is really worthwhile to use linked lists in the programs we run on a daily basis.It seems that in most cases array-based data structures are more advantageous, both in terms of memory space and, most importantly, in terms of execution speed.While it is easy to calculate the complexity of the operations, what about the actual execution efficiency? In this paper we try to answer this question by introducing a new benchmark.Our survey compares several linked-list implementations with some array-based implementations.We also propose a new array-based data structure that is well suited for list operations.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/24/2019

Lock-Free Transactional Adjacency List

Adjacency lists are frequently used in graphing or map based application...
research
02/12/2020

Uniform Linked Lists Contraction

We present a parallel algorithm (EREW PRAM algorithm) for linked lists c...
research
08/29/2023

Chunked Lists versus Extensible Arrays for Text Inversion

In our 2017 work on in-memory list-based text inversion [Hawking and Bil...
research
12/15/2020

Sorting Lists with Equal Keys Using Mergesort in Linear Time

This article introduces a new optimization method to improve mergesort's...
research
04/20/2020

Black-White Array: A New Data Structure for Dynamic Data Sets

A new array based data structure named black-white array (BWA) is introd...
research
01/01/2021

Chunk List: Concurrent Data Structures

Chunking data is obviously no new concept; however, I had never found an...
research
04/30/2021

Speeding up Python-based Lagrangian Fluid-Flow Particle Simulations via Dynamic Collection Data Structures

Array-like collection data structures are widely established in Python's...

Please sign up or login with your details

Forgot password? Click here to reset