Arrays in Data Structures: Complete Guide with Real-Life Examples and Java Code

 

Arrays in Data Structures: Complete Beginner Guide with Examples

---

Introduction

Jab hum programming start karte hain, sabse pehla data structure jo seekhte hain wo hota hai Array.

Array ek basic structure hai, lekin iska concept samajhna bahut zaruri hai kyunki almost har algorithm me arrays ka use hota hai.

Agar array strong ho gaya, to DSA ka 40% foundation clear ho jata hai.

Array DSA ka sabse basic aur fundamental data structure hai.
Almost har programming language me array available hota hai.

Agar aap DSA start kar rahe ho, to array se hi shuruaat hoti hai.

---

What is an Array?

Definition

An Array is a linear data structure that stores multiple elements of the same data type in contiguous memory locations, and each element is accessed using an index.

Is definition ko tod kar samjhte hain:

• Linear → Data ek sequence me hota hai

• Same data type → Sab elements ek hi type ke honge (int, double, etc.)

• Contiguous memory → Memory me ek ke baad ek store hote hain

• Index-based access → Har element ka ek position number hota hai

Simple words me:

Array ek list hoti hai jisme same type ke elements sequence me store hote hain.

---

Key Characteristics of Array

1. Fixed size (generally)

2. Same data type elements

3. Stored in contiguous memory

4. Index-based access

---

Real Life Example

Socho classroom me students ek line me baithe hain.

Seat number 0 → First student
Seat number 1 → Second student

Agar hume 5th student chahiye, to directly us seat number par ja sakte hain.

Ye direct access hi array ki power hai.

Socho ek train coach me 10 seats hain.

Seat number:

0, 1, 2, 3, 4, 5, 6, 7, 8, 9

Agar kisi ko seat 5 par baithna hai, to directly seat 5 par ja sakte ho.

Aapko 0 se 4 tak check nahi karna padega.

Ye direct access hi array ka sabse bada advantage hai.

---

Real Life Example 2 – Marks of Students

Class me 5 students ke marks store karne hain.

Instead of:

marks1, marks2, marks3...

Hum use karte hain:

marks[0], marks[1], marks[2]...

Ye simple aur organized method hai.

---

How Array Works in Memory

Array ke elements continuous memory me store hote hain.

Example:

int arr[5];

Memory me kuch aisa store hota hai:

1000
1004
1008
1012
1016

Har element 4 bytes (int) leta hai.

Isliye arr[3] ka address easily calculate ho sakta hai:

Base address + (index × size)

Isi wajah se array me index access O(1) hota hai.

---

Creating Array in Java

Method 1: Declaration + Initialization

int[] numbers = {10, 20, 30, 40, 50};

Method 2: Declare First, Then Assign

int[] numbers = new int[5];
numbers[0] = 10;
numbers[1] = 20;

---

Accessing Elements in Java

public class Main {
    public static void main(String[] args) {
        int[] numbers = {10, 20, 30, 40, 50};
        System.out.println(numbers[2]);
    }
}

Output:
30

Time Complexity = O(1)

---

Traversing an Array

public class Main {
    public static void main(String[] args) {
        int[] numbers = {10, 20, 30, 40, 50};
        
        for(int i = 0; i < numbers.length; i++) {
            System.out.println(numbers[i]);
        }
    }
}

Time Complexity = O(n)

---

Insertion in Array

Java me fixed size array hota hai.

Middle me insert karne ke liye shifting karni padti hai.

Example:

public class Main {
    public static void main(String[] args) {
        int[] arr = {10, 20, 30, 40, 0};
        
        int position = 2;
        int value = 25;
        
        for(int i = arr.length - 1; i > position; i--) {
            arr[i] = arr[i - 1];
        }
        
        arr[position] = value;
        
        for(int num : arr) {
            System.out.print(num + " ");
        }
    }
}

Time Complexity = O(n)

---

Deletion in Array

Deletion me bhi shifting hoti hai.

public class Main {
    public static void main(String[] args) {
        int[] arr = {10, 20, 30, 40, 50};
        int position = 2;
        
        for(int i = position; i < arr.length - 1; i++) {
            arr[i] = arr[i + 1];
        }
        
        for(int num : arr) {
            System.out.print(num + " ");
        }
    }
}

Time Complexity = O(n)

---

Advantages of Array

1. Fast access using index

2. Easy to implement

3. Less memory overhead

---

Disadvantages of Array

1. Fixed size

2. Insertion and deletion slow

3. Same data type restriction

---

Time and Space Complexity Summary

Access → O(1)
Traversal → O(n)
Insertion → O(n)
Deletion → O(n)
Space Complexity → O(n)

---

Applications of Array

• Storing marks of students

• Matrix representation

• Implementing other data structures

• Sorting & Searching algorithms

---

Conclusion

Array DSA ka foundation topic hai.
Agar array strong ho gaya, to aage ke topics (Stack, Queue, Linked List) samajhna easy ho jata hai.

Array DSA ka basic building block hai.
Har major algorithm array ke concept par based hota hai.

Agar array clear hai, to searching, sorting, stack, queue samajhna easy ho jata hai.