This is for Java in my Data structures class:

3. Assume that numbers is a large array of integers, currently holding N values in locations 0 through N - 1. Describe the order of magnitude of each of the following operations using Big-O notation: (a) Insert the number 21 into location N of numbers. (b) Shift all values in the numbers array to the "right" one location to make room at location 0 for a new number without disrupting the order of the current values insert the number 21 into location 0. (c) Randomly choose a location L from 0 to N-1; shift all values in the numbers array, from location L to location N - 1, to the right one location to make room at location L for a new number; insert the number 21 into location L