1. Dynamic Array

Goal: Build a dynamic array that can grow in size and support basic operations.

🔧 Implementation Tasks:

• [x] Create DynamicArray class with initial capacity and resizing logic
• [x] Implement insert(value) – add to the end; resize if full
• [x] Implement find(index) – return value at index
• [x] Implement deleteAt(index) – remove at index, shift elements left
• [x] Implement delete(value) – remove first occurrence, shift elements left
• [x] Implement traverse() – return or print all elements in order

🧪 Test Tasks:

• [x] Test resizing by inserting more than initial capacity
• [x] Test deleteAt on first, middle, and last index
• [x] Test delete by value that exists and doesn’t
• [x] Test find on valid and invalid indexes
• [x] Traverse array after multiple operations

2. Sorted Dynamic Array

Goal: Implement a dynamic array that maintains elements in sorted order after every insert.

🔧 Implementation Tasks: