1.2 Array Operations - Traversal, Insertion |
Explanation with C Program | DSA Course
Operations on Arrays in Data Structure
In this blog post, we will be discussing the various operations that can
be performed on 1D arrays in data structures. We have already covered
the fundamentals of arrays, including why they are needed, how to
declare them, and their memory representation in a previous post.
Today, we will focus on how to traverse an array, how to insert data into
an array, and the three types of insertion (at the beginning, at the end,
or at a specific position). The most important operations we will cover
are array traversal, insertion, deletion, sorting, and searching for a
particular key.
Traversal and Insertion with Code Examples
We will start by discussing how to traverse an array and insert data into
an array, with the help of code examples. We will also provide code for
array deletion.
Array Size and Memory Allocation
Before we dive into the code, it's important to understand that the size
of an array is fixed at compile time and cannot be changed at runtime.
Additionally, arrays do not have any bounds checking property at
runtime, so it is the programmer's responsibility to check the
boundaries of the array in the program. For example, if we declare an
array of size 50, 200 bytes of memory would be allocated by the
memory manager. The base address is 100, so 100 to 299 bytes should
be allocated to this array.
Reading and Writing Data
Now, let's discuss how to read and write data in an array.
The scanf function is used to take input from the user, and
the printf function is used to print something on the output screen.
When using scanf , we write %d for integers. We use a for loop to
iterate over the array, and the value starts from 0 till the size minus one
(i++).
Explanation with C Program | DSA Course
Operations on Arrays in Data Structure
In this blog post, we will be discussing the various operations that can
be performed on 1D arrays in data structures. We have already covered
the fundamentals of arrays, including why they are needed, how to
declare them, and their memory representation in a previous post.
Today, we will focus on how to traverse an array, how to insert data into
an array, and the three types of insertion (at the beginning, at the end,
or at a specific position). The most important operations we will cover
are array traversal, insertion, deletion, sorting, and searching for a
particular key.
Traversal and Insertion with Code Examples
We will start by discussing how to traverse an array and insert data into
an array, with the help of code examples. We will also provide code for
array deletion.
Array Size and Memory Allocation
Before we dive into the code, it's important to understand that the size
of an array is fixed at compile time and cannot be changed at runtime.
Additionally, arrays do not have any bounds checking property at
runtime, so it is the programmer's responsibility to check the
boundaries of the array in the program. For example, if we declare an
array of size 50, 200 bytes of memory would be allocated by the
memory manager. The base address is 100, so 100 to 299 bytes should
be allocated to this array.
Reading and Writing Data
Now, let's discuss how to read and write data in an array.
The scanf function is used to take input from the user, and
the printf function is used to print something on the output screen.
When using scanf , we write %d for integers. We use a for loop to
iterate over the array, and the value starts from 0 till the size minus one
(i++).
