arrays the machine can alter the scanned symbol and its behavior is in part determined by that symbolbut the symbols on the tape elsewhere do not affect the behavior of the machine -"intelligent machinery, turing the simplest data structure is the arraywhich is contiguous block of memory it is usually used to represent sequences given an array aa[idenotes the ( )th object stored in the array retrieving and updating [itakes ( time insertion into full array can be handled by resizingi allocating new array with additional memory and copying over the entries from the original array this increases the worst-case time of insertionbut if the new array hasfor examplea constant factor larger than the original arraythe average time for insertion is constant since resizing is infrequent deleting an element from an array entails moving all successive elements one over to the left to fill the vacated space for exampleif the array is ithen deleting the element at index results in the array (we do not care about the last value the time complexity to delete the element at index from an array of length is ( ithe same is true for inserting new element (as opposed to updating an existing entryarray boot camp the following problem gives good insight into working with arraysyour input is an array of integersand you have to reorder its entries so that the even entries appear first this is easy if you use (nspacewhere is the length of the array howeveryou are required to solve it without allocating additional storage when working with arrays you should take advantage of the fact that you can operate efficiently on both ends for this problemwe can partition the array into three subarraysevenunclassifiedand oddappearing in that order initially even and odd are emptyand unclassified is the entire array we iterate through unclassifiedmoving its elements to the boundaries of the even and odd subarrays via swapsthereby expanding even and oddand shrinking unclassified def even_odd ( )next_even next_odd len( while next_even next_odd if anext_even = next_even + elseanext_even ]anext_odd anext_odd ]anext_even next_odd -