Array:
A collection of elements stored in contiguous memory locations. Each element is accessed using an index.
Indexing:
The position of an element in an array, starting from 0 for the first element.
Insertion:
Adding a new element at a specific position in the array.
If inserting in the middle or beginning, elements need to be shifted.
Deletion:
Removing an element from the array.
If removing from the middle or beginning, elements must be shifted left to fill the gap.
Searching:
Finding an element in an array.
Common methods include:
- Linear Search (checking each element one by one)
- Binary Search (dividing the array into halves, works only on sorted arrays)
Traversal:
Accessing each element of the array one by one.
Sorting:
Arranging elements in ascending or descending order, using techniques like:
- Bubble Sort
- Selection Sort
- Quick Sort, etc.