Arrays in Data Structures and Algorithms

Code Example

#include<iostream>
using namespace std;

void insertAnElement(int arr[], int size, int data, int index) {
    int i;

    for(i = size - 2; i >= index; i--) {
        arr[i + 1] = arr[i];
    }

    arr[index] = data;
}

int main() {
    int size;
    cout << "Enter size of array :" << endl;
    cin >> size;

    int arr[size];
    cout << "Enter array elements :" << endl;
    for(int i = 0; i < size - 1; i++) {
        cin >> arr[i];
    }

    int data;
    cout << "Enter element to insert :" << endl;
    cin >> data;

    int index;
    cout << "Enter index to insert :" << endl;
    cin >> index;

    insertAnElement(arr, size, data, index);

    cout << "Printing array elements :" << endl;
    for(int i = 0; i < size; i++) {
        cout << arr[i] << " ";
    }

    return 0;
}

Output

Array - Deletion Operation

Array deletion is the process of removing an item from a particular spot in a list. It involves shifting all items after that spot to the left to fill the gap. This operation ensures that the list remains orderly and efficient. It's like taking a book out of a shelf and rearranging the books so there are no empty spaces. Array deletion is essential for managing data effectively in programming and helps maintain the integrity of the list. By understanding array deletion, programmers can build more efficient and organized software solutions.

Code Example

#include<iostream>
using namespace std;

void deleteAnElement(int arr[], int size, int index) {
    for(int i = index; i < size - 1; i++) {
        arr[i] = arr[i + 1];
    }
}

int main() {
    int size;
    cout << "Enter size of array :" << endl;
    cin >> size;

    int arr[size];
    cout << "Enter array elements :" << endl;
    for(int i = 0; i < size; i++) {
        cin >> arr[i];
    }

    int index;
    cout << "Enter index number to delete :" << endl;
    cin >> index;

    deleteAnElement(arr, size, index);

    cout << "Printing array after deletion :" << endl;
    for(int i = 0; i < size - 1; i++) {
        cout << arr[i] << " ";
    }

    return 0;
}

Output

Conclusion

Arrays are like organized boxes where we can store similar things in a neat row. Each item in the box has its number, starting from zero. This makes it super easy to find what we need without searching all over the place. Arrays are great for handling lots of stuff quickly and keeping things tidy in computer programs. We can add new things wherever we want in the array, just like putting books on a shelf or removing them neatly without leaving empty spaces. Arrays make it easier for computers to work with lots of information, helping us build better programs faster.