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.
- Write out problem statement
- Then wrote a function that would take an array and value to insert
- divide array in half to find midpoint
- split list into left and right
- create new array by concatenating left_array, the new value, and right_array
- return modified array
- The Big O time is O(N) and space is O(N)
