Search
4 articles for “array and linked list”
-
Impact of Time Complexity Using Array and Linked List in Data Structure
Abstract: Data structures are techniques for maintaining, manipulating, and storing data on a computer, enabling efficient access and modification. They support various operations, such as insertion, deletion, updating, and sorting. Examples of data structure include arrays, linked lists, graphs, heaps, stacks, and queues. Each data structure is designed to meet specific needs and solve particular problems. Typically, we identify the problem, devise a solution as an algorithm, and then write an …
Published in International Journal of Data Structure Studies · Vol. 2, Issue 2, 2024 · pp. 41–48 Read article
-
An Auxiliary Array Indexing Approach for Efficient Binary Search in Linked Lists
Abstract: The paper covers an algorithm for searching a linked list structure using binary search. Binary search is a classic example of an algorithm that follows the divide-and-conquer approach. Binary search may be used to find elements in an array. Trying to apply the conventional binary search to a linked list simply does not work out very well; it still has an O(n) time complexity, the same as linear search. This …
Published in International Journal of Data Structure Studies · Vol. 4, Issue 1, 2026 · pp. 21–28 Read article
-
Advancements in Data Structures: Bridging the Gap Between Theory and Real-world Applications
Abstract: In the rapidly advancing landscape of computer science, this study unfolds a comprehensive exploration of Data Structures, spanning from foundational principles to cutting-edge innovations. Data structures form the backbone of computational processes, and this study aims to dissect and illuminate their pivotal role. Beginning with fundamental concepts such as Arrays, Linked Lists, Stacks, and Queues, the narrative progresses to intricate structures like Trees, Graphs, and Hash Tables. Practical applications in …
Published in International Journal of Data Structure Studies · Vol. 2, Issue 1, 2024 · pp. 14–20 Read article
-
Array-Linked Data Structure: Introducing a Hybrid Model of Memory Management and Faster and Easier Insertion and Reallocation Procedures
Abstract: Here, I have introduced a new data structure titled “Array-Linked Data Structure”. It incorporates a hybrid model of memory allocation, introducing a new insertion procedure in an existing data structure which is faster than that for arrays. It also offers O(c) access time where c is a constant. The access time is worse than O(1) for an array but still better than that for a linked list since the index …
Published in International Journal of Data Structure Studies · Vol. 1, Issue 1, 2023 · pp. 1–11 Read article