A linked list is a data structure in which the objects are arranged in a linear order. Unlike an array, though, in which the linear order is determined by the array indices, the order in a linked list is determined by a pointer in each object. Linked lists provide a simple, flexible representation for dynamic sets, supporting (though not necessarily efficiently).
- Minimum and maximum in Design and analysis of algorithms free download
- Randomized algorithms in Design and analysis of algorithms free pdf
- The master method in Design and analysis of algorithms free download
- Analyzing divide-and-conquer algorithms in Design and analysis of algorithms free pdf
- Introduction to Algorithms Design and analysis of algorithms free pdf
Linked lists Design and analysis of algorithms notes is very useful for the preparation. Thanks for sharing.
not good one...........
Last edited by edwinjarvis; 18th November 2013 at 05:52 PM.
This is very short information about the Linked List......
not enough for learning all the things about linked list...