RIP Linked List - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail (Preprint/Prepublication) Année : 2023

RIP Linked List

Résumé

Linked lists have long served as a valuable teaching tool in programming. However, the question arises: Are they truly practical for everyday program use? In most cases, it appears that array-based data structures offer distinct advantages, particularly in terms of memory efficiency and, more importantly, execution speed. While it's relatively straightforward to calculate the complexity of operations, gauging actual execution efficiency remains a challenge. This paper addresses this question by introducing a new benchmark. Our study compares various linked list implementations with several array-based alternatives. We also demonstrate the ease of incorporating memory caching for linked lists, enhancing their performance. Additionally, we introduce a new array-based data structure designed to excel in a wide range of operations.
Fichier principal
Vignette du fichier
riplinkedlist.pdf (217.75 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04124714 , version 1 (10-06-2023)
hal-04124714 , version 2 (29-03-2024)

Licence

Paternité

Identifiants

Citer

Benoît Sonntag, Dominique Colnet. RIP Linked List. 2023. ⟨hal-04124714v2⟩
12 Consultations
31 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More