Array
Array
i n t a r r [ 5 ] = {1 , 2 , 3 , 4 , 5};
i n t v a l u e = a r r [ 2 ] ; // A c c e s s i n g t h e t h i r d e l e m e n t ( i n
// Example o f a r r a y t r a v e r s a l
i n t main ( ) {
i n t a r r [ ] = {3 , 1 , 4 , 1 , 5};
int size = 5;
p r i n t f ( ” Array elements : ” ) ;
displayArray ( arr , s i z e ) ;
return 0;
Anish Kumar Yadav Understanding of Arrays July 11, 2024 6 / 20
Insertion and Deletion in Arrays in C
Insertion: Add a new element at a specific position.
void i n s e r t E l e m e n t ( i n t a r r [ ] , i n t ∗ s i z e , i n t p o
if ( position < 0 || position > ∗ size ) {
p r i n t f ( ” I n v a l i d p o s i t i o n ! \ n” ) ;
return ;
}
// S h i f t e l e m e n t s t o make s p a c e f o r t h e new
f o r ( i n t i = ∗ s i z e − 1 ; i >= p o s i t i o n ; i −−)
arr [ i + 1] = arr [ i ] ;
}
arr [ position ] = value ;
( ∗ s i z e )++;
}
Deletion: Remove an element from a specific position.
void d e l e t e E l e m e n t ( i n t a r r [ ] , i n t ∗ s i z e , i n t p
i f ( p o s i t i o n < 0 | | p o s i t i o n >= ∗ s i z e ) {
Anish Kumar Yadav Understanding of Arrays July 11, 2024 7 / 20
Examples of Insertion and Deletion
Linear Search
Binary Search
Bubble Sort
Selection Sort
Insertion Sort
Merge Sort
Quick Sort
Row-Major Order:
Formula:
loc = base address + (row × num cols + col) × sizeof(element type)
Column-Major Order:
Formula:
loc = base address + (col × num rows + row ) × sizeof(element type)