Features of using data structures in the view of linked lists
Keywords:
algorithms, data structures, singly linked lists, doubly linked lists, programmingAbstract
This article discusses the topic of using singly and doubly linked lists in algorithmization and data processing. The main principles of construction and operation of linked lists, their advantages and disadvantages compared to other data structures are highlighted. Practical applications in such areas as implementation of sorting algorithms, memory management, data processing in databases, graphical user interfaces, etc. are explored. Modern trends in the development of these data structures, zokerms, such as optimization for specific tasks, use in parallel and distributed programming, as well as the impact of artificial intelligence and machine learning technologies on their use, are studied.
References
Креневич А. П. Алгоритми і структури даних: підручник. Київ: ВПЦ «Київський Університет», 2021. 200 с.
Лінійний однозв’язний список. URL: https://erudyt.net/navchalni-predmety/informatika/prohramuvannya/linijnyj-odnozvyaznyj-spysok.html (дата звернення 03.02.2024).
Двозв’язкові списки. URL: https://krypton.com.ua/rozdil-2-struktury-danyh/dvozvyazkovi-spysky/ (дата звернення 03.02.2024).
Korman T. H. Algorithms. Unlocked. The MIT Press, Massachusetts Institute of Technology, 2013. 207 p.
Stephens R. Essential Algorithms: A Practical Approach to Computer Algorithms Using. John Wiley & Sons, 2013. 624 p.
Sedgewick R., Wayne K. Algorithms. Addison-Wesley Professional, 2020. 956 p.
Bhargava A. Grokking Algorithms: An Illustrated Guide for Programmers and Other Curious People. Manning Publications, 2016. 256 p.
Schildt H. C#: The Complete Reference. McGraw-Hill Osborne Media, 2002. 933 p.
Goodrich M. T., Tamassia R., Goldwasser M. H. Data Structures and Algorithms in Python. WILEY, 2013. 768 p.
Aho A. V., Ullman J. D., Hopcroft J. E. Data Structures and Algorithms. Addison Wesley, 1982. 448 p.
