DSA - Array.pptx

Array is a container which can hold a fix number of items and
these items should be of the same type. Most of the data
structures make use of arrays to implement their algorithms.
Following are the important terms to understand the concept of
Array.
Element − Each item stored in an array is called an element.
Index − Each location of an element in an array has a numerical
index, which is used to identify the element.
Array Representation
Arrays can be declared in various ways in different languages. For
illustration, let's take C array declaration.

Arrays can be declared in various ways in different languages.
For illustration, let's take C array declaration.
■ Index starts with 0.
■ Array length is 10 which means it can store 10 elements.
■ Each element can be accessed via its index.

Basic Operations
Following are the basic operations supported by an array.
■ Traverse − print all the array elements one by one.
■ Insertion − Adds an element at the given index.
■ Deletion − Deletes an element at the given index.
■ Search − Searches an element using the given index or by the
value.
■ Update − Updates an element at the given index.

Traverse Operation
This operation is to traverse through the elements of an array.
Example
#include <stdio.h>
main() {
int LA[] = {1,3,5,7,8};
int item = 10, k = 3, n = 5;
int i = 0, j = n;
printf("The original array elements are :n");
for(i = 0; i<n; i++) {
printf("LA[%d] = %d n", i, LA[i]);
}
}

Insertion Operation
Insert operation is to insert one or more data elements into
an array. Based on the requirement, a new element can be
added at the beginning, end, or any given index of array.
Here, we see a practical implementation of insertion
operation, where we add data at the end of the array −
Example

#include <stdio.h>
main() {
int LA[] = {1,3,5,7,8};
int item = 10, k = 3, n = 5;
int i = 0, j = n;
for(i = 0; i<n; i++) {
}
n = n + 1;
while( j >= k) {
LA[j+1] = LA[j];
j = j - 1;
}
LA[k] = item;
printf("The array elements after insertion :n");
for(i = 0; i<n; i++) {
}
}

Deletion Operation
Deletion refers to removing an existing element from the array
and re-organizing all elements of an array.
Algorithm
Consider LA is a linear array with N elements and K is a positive
integer such that K<=N. Following is the algorithm to delete an
element available at the Kth position of LA.
1. Start
2. Set J = K
3. Repeat steps 4 and 5 while J < N
4. Set LA[J] = LA[J + 1]
5. Set J = J+1
6. Set N = N-1
7. Stop

#include <stdio.h>
void main() {
int LA[] = {1,3,5,7,8};
int k = 3, n = 5;
int i, j;
for(i = 0; i<n; i++) {
}
j = k;
while( j < n) {
LA[j-1] = LA[j];
j = j + 1;
}
n = n -1;
printf("The array elements after deletion :n");
for(i = 0; i<n; i++) {
}
}

Search Operation
You can perform a search for an array element based on its value
or its index.
Algorithm
integer such that K<=N. Following is the algorithm to find an
element with a value of ITEM using sequential search.
1. Start
2. Set J = 0
3. Repeat steps 4 and 5 while J < N
4. IF LA[J] is equal ITEM THEN GOTO STEP 6
5. Set J = J +1
6. PRINT J, ITEM
7. Stop

#include <stdio.h>
void main() {
int LA[] = {1,3,5,7,8};
int item = 5, n = 5;
int i = 0, j = 0;
for(i = 0; i<n; i++) {
}
while( j < n){
if( LA[j] == item ) {
break;
}
j = j + 1;
}
printf("Found element %d at position %dn", item, j+1);
}

Update Operation
Update operation refers to updating an existing element from the
array at a given index.
Algorithm
integer such that K<=N. Following is the algorithm to update an
element available at the Kth position of LA.
1. Start
2. Set LA[K-1] = ITEM
3. Stop

#include <stdio.h>
void main() {
int LA[] = {1,3,5,7,8};
int k = 3, n = 5, item = 10;
int i, j;
for(i = 0; i<n; i++) {
}
LA[k-1] = item;
printf("The array elements after updation :n");
for(i = 0; i<n; i++) {
}
}

DSA - Array.pptx

More Related Content

Similar to DSA - Array.pptx

Recently uploaded

DSA - Array.pptx