![Insert an element at a particular index in an array
Insert a given element at a specific position in an array.
Input
int arr[5] = {10, 20, 30, 40, 50}
Element = 100 position = 2.
Output
{10, 20, 100, 30, 40, 50}
Algorithm
1. Get the element value which needs to
be inserted.
2. Get the position value.
3. Check whether the position value is valid
or not.
4. If it is valid,
Shift all the elements from the last index
to position index by 1 position to the right.
insert the new element in arr[position]
5. Otherwise,
Invalid Position](https://image.slidesharecdn.com/ds1-230724014444-e6ddf24d/85/DS1-pptx-3-320.jpg)
![Implementation Algorithm:
1. Set index value as -1 initially. i.e. index = -1
2. Get key value from the user which needs to be deleted.
3. Search and store the index of a given key
[index will be -1, if the given key is not present in the array]
4. if index not equal to -1
Shift all the elements from index + 1 by 1 position to the left.
5. else
print "Element Not Found"](https://image.slidesharecdn.com/ds1-230724014444-e6ddf24d/85/DS1-pptx-9-320.jpg)
![Searching an element in an array
Search whether the given key is present or not in the array.
Algorithm
1. Iterate the array using the loop.
2. Check whether the given key present in
the array i.e. arr[i] == key.
3. If yes,
print "Search Found".
4. Else
print "Search Not Found".](https://image.slidesharecdn.com/ds1-230724014444-e6ddf24d/85/DS1-pptx-12-320.jpg)
DS1.pptx
- 2. Array Index
- 3. Insert an element at a particular index in an array Insert a given element at a specific position in an array. Input int arr[5] = {10, 20, 30, 40, 50} Element = 100 position = 2. Output {10, 20, 100, 30, 40, 50} Algorithm 1. Get the element value which needs to be inserted. 2. Get the position value. 3. Check whether the position value is valid or not. 4. If it is valid, Shift all the elements from the last index to position index by 1 position to the right. insert the new element in arr[position] 5. Otherwise, Invalid Position
- 7. Remove a specific element from array Let's write an algorithm to remove a specific element from the array. Algorithm 1. Find the given element in the given array and note the index. 2. If the element found, Shift all the elements from index + 1 by 1 position to the left. Reduce the array size by 1. 3. Otherwise, print "Element Not Found"
- 8. Visual Representation Let's take an array of 5 elements. 1, 20, 5, 78, 30. If we remove element 20 from the array, the execution will be,
- 9. Implementation Algorithm: 1. Set index value as -1 initially. i.e. index = -1 2. Get key value from the user which needs to be deleted. 3. Search and store the index of a given key [index will be -1, if the given key is not present in the array] 4. if index not equal to -1 Shift all the elements from index + 1 by 1 position to the left. 5. else print "Element Not Found"
- 12. Searching an element in an array Search whether the given key is present or not in the array. Algorithm 1. Iterate the array using the loop. 2. Check whether the given key present in the array i.e. arr[i] == key. 3. If yes, print "Search Found". 4. Else print "Search Not Found".
- 13. Search Found:
- 15. Implementation of Searching an Element: