DATA STRUCTURE

1. What is Data Structure

1.1. A data structure is a specialized format for organizing, processing, retrieving and storing data. One of the most basic data structures used in general computer programming is the array.

2. Benefit of Data Structure

2.1. Data structures also aid us in efficiently storing data on circles so that we can recover the data.

2.2. Data structures allow us to reuse data. We can create a few data sets in certain organizations and put them in libraries for use by various clients.

2.3. Data structures provided by various programming languages accompany implicit capabilities (or methods) that let us use the specific database more productively.

3. Types of Data Structure

3.1. Primitive

3.1.1. Data structures can be used to store only a single value. They are the foundation of data manipulation. Ex: int, char, float, double, and pointers.

3.2. Non-Primitive

3.2.1. Complicated data structures that are derived from the primitive data structures. Ex: Array, Linked list, stack.

3.3. Linear

3.3.1. A structure in which the elements are stored sequentially, and the elements are connected to the previous and the next element. Ex: Stacks, Queues, Arrays, and Linked lists.

3.4. Non-Linear

3.4.1. A form of data structure where the data elements don't stay arranged linearly or sequentially. Ex: trees and graphs.

3.5. Static

3.5.1. Size is fixed at compile time, and does not grow or shrink at runtime. Ex: Arrays.

3.6. Dynamic

3.6.1. The size of the structure is not fixed and can be modified during the operations performed on it. Ex: LinkedList, Stack, Vector.

4. Advantage of using Array

4.1. Arrays store multiple data of similar types with the same name.

4.2. Arrays are a simple data structure to implement and can be implemented in most programming languages.

4.3. It is helpful to store any type of data with a fixed size.

5. Array

5.1. An array is a linear data structure that collects elements of the same data type and stores them in contiguous and adjacent memory locations

6. Disadvantages of using Array

6.1. Insertion and deletion operations are costly in arrays as elements are stored in contiguous memory.

6.2. Resizing an array can be time-consuming, especially if it needs to be done frequently.

6.3. Arrays have limited support for object-oriented programming and cannot store objects.