Introduction to Arrays

Imagine you have a row of lockers, each numbered and placed side by side. You want to store your books in these lockers so that you can quickly find any book by just knowing the locker number. This is the basic idea behind an array - a fundamental linear data structure used to organize and store multiple items of the same type in a contiguous block of memory.

Arrays are essential in programming and competitive exams because they allow efficient access and management of data. However, they come with some limitations, such as a fixed size decided at the time of creation. Understanding arrays thoroughly will help you solve many problems quickly and accurately.

Array Definition and Memory Layout

An array is a collection of elements, all of the same data type, stored in contiguous memory locations. The term contiguous means that the elements are placed one after another without any gaps.

Each element in the array can be accessed directly using its index, which starts from 0. This zero-based indexing means the first element is at position 0, the second at position 1, and so on.

For example, consider an array of 5 integers representing daily expenses in INR:

• Day 1: Rs.150
• Day 2: Rs.200
• Day 3: Rs.175
• Day 4: Rs.225
• Day 5: Rs.190

These values are stored one after another in memory, allowing quick access by index.

Advantages of Arrays:

• Constant-time access: Accessing any element by index takes the same amount of time, regardless of the array size.
• Simple structure: Easy to understand and use for storing data.

Limitations:

• Fixed size: The size must be known beforehand and cannot be changed dynamically.
• Costly insertions and deletions: Inserting or deleting elements in the middle requires shifting other elements.

Basic Operations on Arrays

Arrays support several fundamental operations that allow us to manipulate and retrieve data efficiently. Let's explore these operations with clear explanations and examples.

Traversal

Traversal means visiting each element of the array one by one. This is often the first step in many algorithms, such as searching or finding the maximum value.

Example: To print all daily expenses stored in an array, we start from index 0 and move up to the last index.

Insertion

Insertion involves adding a new element at a specific position in the array. Since arrays have fixed size, insertion is only possible if there is space available.

When inserting at the end, the new element is simply placed at the next free index. However, inserting at the beginning or middle requires shifting all subsequent elements one position to the right to make space.

Deletion

Deletion removes an element from a specific position. After deletion, all elements to the right of that position must be shifted one position to the left to fill the gap.

Searching

Searching means finding the position of a particular element in the array. The simplest method is linear search, where we check each element from start to end until we find the target.

graph TD    Start[Start Operation] --> CheckPos{Is position valid?}    CheckPos -- No --> End[Stop: Invalid Position]    CheckPos -- Yes --> InsertShift[Shift elements right]    InsertShift --> InsertElement[Insert new element]    InsertElement --> End    StartDel[Start Deletion] --> CheckPosDel{Is position valid?}    CheckPosDel -- No --> EndDel[Stop: Invalid Position]    CheckPosDel -- Yes --> DeleteShift[Shift elements left]    DeleteShift --> EndDel

This flowchart shows the general steps for insertion and deletion in arrays.

Worked Examples

    matrix[0][0] = 1; matrix[0][1] = 2; matrix[0][2] = 3;    matrix[1][0] = 4; matrix[1][1] = 5; matrix[1][2] = 6;    matrix[2][0] = 7; matrix[2][1] = 8; matrix[2][2] = 9;    

Tips & Tricks

Common Mistakes to Avoid