Skip to Main Content
Data Structures Using C, 2nd Edition by Pearson
book

Data Structures Using C, 2nd Edition by Pearson

by A. K. Sharma
May 2024
Intermediate to advanced content levelIntermediate to advanced
521 pages
14h 12m
English
Pearson India
Content preview from Data Structures Using C, 2nd Edition by Pearson
274 Data Structures Using C
6.8 COMPARISON OF SEQUENTIAL AND LINKED STORAGE
A list can be stored in a one-dimensional array and in a linked list as well. The choice of data structure
depends upon the problem at hand and the type of operations to be performed on the data. A summa-
rized comparison of sequential and linked storage is given below:
n Unlike arrays, the linked list is a dynamic data structure. e linked list implementation adds
the elements to the list by getting the memory allocated dynamically. erefore, the number
of elements present in the linked list is limited only by the memory available to the operating
system. We can ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Data Structures Using C

Data Structures Using C

Samir Kumar Bandyopadhyay, Kashi Nath Dey
Intermediate C Programming, 2nd Edition

Intermediate C Programming, 2nd Edition

Yung-Hsiang Lu, George K. Thiruvathukal

Publisher Resources

ISBN: 9781299831582