Optimization of Cache Memory Using Unrolled Linked List

Data structures play an important role to reduce the cost of memory access. First array was introduced which gives fast cache-access, as elements are stored in consecutive places. But it memory, don’t allow insertion at run-time, and most important takes large number of shifting operations to insert or delete an item at any other position excluding last position. After that Linked-List was introduced to overcome disadvantages of array. It has advantages of quick insertions and incremental growth. At run-time new data can be inserted and avoid wastage of memory. But it also has some disadvantages, like requirement of extra memory space to store refere assigned, one for each element. Special type of Linked-List is introduced which combines the cache advantages of an array but the quick insertions and incremental growth of a linked list. This is Unrolled Linked single element. As Unrolled Linked-list is a cache-sensitive data structure, which increases the speed of memory access by using arrays. We’ll implement its all basic operation along with its applications searching, traversing and sorting. Like array and Linked