INSERTION IN ARRAY
1. AT BEGINNING - It means the element to be inserted will be inserted in the starting of the
ARRAY by increasing the size by one. i.e. at index - 0.
TIME COMPLEXITY - O(1)
2. AT MIDDLE/GIVEN POSITION - It means the element to be inserted will be inserted at the given
position of the
ARRAY and rest of the elements next to it will shift to one
place towards right by increasing the size by one. i.e. at index - position-1.
TIME COMPLEXITY - O(n)
3. AT END - It means the element to be inserted will be inserted at the last position of the
ARRAY by increasing the size by one. i.e. at index - (-1).
TIME COMPLEXITY - O(1)
DELETION IN ARRAY
1. FROM BEGINNING - It means the element to be removed will be removed from the starting of the
ARRAY by decreasing the size by one. i.e. at index - 0.
TIME COMPLEXITY - O(1)
2. FROM MIDDLE/GIVEN POSITION - It means the element to be deleted will be removed from the given
position of the
ARRAY and rest of the elements next to it will shift to one
place towards left by decreasing the size by one. i.e. at index - position-1.
TIME COMPLEXITY - O(n)
3. FROM END - It means the element to be removed will be deleted from the last position of the
ARRAY by decreasing the size by one. i.e. at index - (-1).
TIME COMPLEXITY - O(1)
SEARCHING IN ARRAY
It means the element to look out for the mentioned or needed element in the
ARRAY by traversing whole array and checking each of the
elements one by one. i.e. index - 0 to size-1
TIME COMPLEXITY - O(n)
SORTING IN ARRAY
It means to sort the ARRAY either in ascending or in descending
order of the elements present in the
ARRAY by traversing whole array. i.e. index - 0 to size-1
TIME COMPLEXITY - O(n2)
![INITIALIZATION - int arr[size] = {comma separated values};](1.png)
![REAL LIFE EXAMPLE - fruits = [name of fruits separated by commas];](2.png)
