Introduction of Data Structures through C Language

Data Structures through C Language

Data Structure is not a language. Data Structure is the concept of 'set of algorithms' used to structure the information.

To structure the data 'n' number of algorithms are proposed

All the algorithms are called "Abstract Data Types" (ADT).

ADT is a set of rules.

Examples of Data Structure algorithms:

Array, Stack, Queue, Linked List, Tree, Graphs, Searching, Sorting etc.

Data Structure Algorithms are divided into two types

1) Linear Data Structure(Array, Stack, Queues, Linked List)

2) Non-Linear Data Structure (Trees, Graphs)

Arrays:

1) It holds more than one element

2) It holds only homogeneous elements

3) It is Indexed based

4) It Derived data types 

5) It doesn't follow any algorithms.

How to access the elements effectively from an Array?

Example: 

int arr[5] = {30, 35, 40, 60, 80};

All these elements get memory allocation

Index Values -->	0	1	2	3	4
	20	30	40	50	60
Memory Address -->	2048	2050	2052	2054	2056