1. Static Array

Goal: Build your own static array class and understand how low-level array operations work.

🔧 Implementation Tasks:

• [x] Create StaticArray class with constructor to initialize fixed size
• [x] Implement push(value) – add to the end (if space)
• [x] Implement pop() – remove from end
• [x] Implement get(index) – return value at index
• [x] Implement set(index, value) – overwrite value at index
• [x] Implement delete(index) – remove at index, shift elements left
• [x] Implement insert(index, value) – insert at index, shift elements right

🧪 Test Tasks:

• [x] Test array boundary cases (overflow on push, underflow on pop)
• [x] Try inserting/deleting at beginning, middle, and end

2. Sorted Array – Task List

Goal: Understand how sorted arrays maintain order and allow efficient search.

🔧 Implementation Tasks:

• [x] Create SortedArray class with fixed capacity
• [x] Implement insert(value) – insert while maintaining sort order (use shifting)