Dynamic Array (Manual Implementation in Java)

This project is a manual implementation of a dynamic array in Java, built from scratch without using ArrayList.

The goal of this project is to demonstrate how dynamic arrays work internally, including:

• Manual resizing
• Element insertion
• Element removal
• Index-based search

---

📌 Features

• Dynamic resizing when capacity is reached
• Insert elements at the end
• Remove elements by index
• Search for an element (indexOf)
• Print stored elements
• Simple and clean API

---

🧠 Why This Project?

Java developers often use ArrayList without understanding how it works internally.

This project helps you understand:

• How arrays grow dynamically
• How memory is reallocated
• How elements are shifted during removal
• How basic data structures are implemented

---

🚀 Usage Example

See Main.java file

---

⚠️ Notes

• This implementation is for educational purposes

• It only supports int values

• No generics are used

• No bounds checking beyond basic validation

---

📚 Concepts Covered

• Arrays

• Dynamic resizing

• Time complexity

• Memory management basics

• Encapsulation