<reponame>plaurion1989/data-structures-and-algorithms<filename>java/code-challenges/whiteboards/challenge-02/insertShiftArray.md
# Reverse an Array
Write a function called `insertShiftArray` which takes in an array and a value to be added. Without utilizing any of the built-in methods available to your language, return an array with the new value added at the middle index.

## Whiteboard Process
![](../whiteboards/challenge-02.png)
## Approach & Efficiency
Knowing not all arrays are going to have a middle value(edge cases), I wrote my if else statement to catch possible array size variations to ensure code wouldn't break regardless of array size.
