Studi Komparatif Efisiensi Memori antara Struktur Data Array dan Linked List
DOI:
https://doi.org/10.63822/wbzdgx50Keywords:
Array, Linked List, Memory Performance, Access Speed, BenchmarkAbstract
The selection of linear data structures directly impacts memory efficiency and software performance. This study conducts a profound comparative analysis between arrays and linked lists using a quantitative experimental approach. Benchmarking was performed across sequential access, random access, insertion, and deletion scenarios using C++ and Python with dataset sizes from 103 to 107 elements. Memory consumption was tracked via Valgrind Massif and the tracemalloc library. In C++, arrays consistently outperform linked lists in sequential access with a 3.2× speedup on 106 elements due to optimal CPU cache locality. Conversely, for middle insertions, linked lists show a dramatic advantage with a constant time of ~50ns, compared to 2.3ms for arrays (46,000× slower). Regarding memory for primitive data, singly linked lists incur a 200% pointer overhead and doubly linked lists 400% on 64-bit systems. This research concludes that arrays serve as the best default for intensive computation, while linked lists are recommended for dynamic data manipulation.
References
Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2022). Introduction to Algorithms (4th ed.). MIT Press.
Hennesy, J. L., & Patterson, D. A. (2017). Computer Organization and Design: The Hardware/Software Interface (5th ed.). Morgan Kaufmann.
Gandolfi, M. (2019). Data Structure Performance Benchmark: Array vs LinkedList. Journal of Computer Science Education, 14(2), 45–58.
Arpit Bhayani. (2025). Why and How Cache Locality Can Make Your Code Faster. Engineering Blogs..
Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2022). Introduction to Algorithms (4th ed.). MIT Press..
Gandolfi, M. (2019). Data Structure Performance Benchmark: Array vs LinkedList. Journal of Computer Science Education, 14(2), 45–58..
HappyCoders.eu. (2024). Array vs. Linked List: Time Complexity, Memory Consumption, and Locality..
Hennesy, J. L., & Patterson, D. A. (2022). Computer Architecture: A Quantitative Approach (6th ed.). Morgan Kaufmann..
Johnson, M., & Brown, R. (2023). Performance Analysis of Linked List Variants in Modern Computing Environments. ACM Computing Surveys, 55(4), 1-28..
JRIIN: Jurnal Riset Informatika dan Inovasi. (2024). Perbandingan struktur linked list dan array dalam manajemen memori. Vol. 1 No. 12..
JSIT: Jurnal Sains Informatika Terapan. (2025). Analisis Komparatif Struktur Data Array Dan Linked List; Evaluasi Performa Dan Implementasi Optimal. Vol. 4 No. 3..
Lazarov, N. (2022). Linked Lists: Design, Implementation and Real-World Performance Analysis..
Martinez, C., Garcia, A., & Rodriguez, P. (2023). Comprehensive Performance Evaluation of Linear Data Structures. Journal of Experimental Algorithmics, 28(2), 112-135..
PatSnap Eureka. (2026). Array Configuration vs Linked Nodes: Scalability Review..
Samyal, V. K., et al. (2025). A Cache-Centric Performance Analysis Of Pointer-Based Data Structures. International Journal of Creative Research Thoughts (IJCRT), 2320-2882..
Unstop. (2026). Array Vs. Linked List: Key Differences & Usages Explained in Detail..
Woltmann, S. (2022). ArrayList vs LinkedList from memory allocation perspective. Stack Overflow Discussion (Updated 2019/2022)..
Zhang, L., & Liu, H. (2023). Cache-Conscious Data Structure Design for Modern Processors. IEEE Transactions on Computers, 72(8), 2145-2158..
Downloads
Published
Issue
Section
License
Copyright (c) 2026 Ummi Rufaidah Hamka, Nurul Syafirah, Muh. Aprian Naufal, Asipa Febriana, Nurjannah Nurjannah, Nurpadila Nurpadila, Ketrin Rinayanti Manullang (Author)
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
