Show description

Since arrays themselves are objects, an array of arrays is an array of objects, and some of those component objects could also be nonarrays. ) Note that a consequence of Property 13 is that changing a reference component value to null has no effect upon the length of the array; null is still a valid value of a reference component. 14; 12 Object[] objects = {x, args, isPrime, fib, b, a}; 13 } 14 } Line 3 declares x[] to be an array of floats but does not allocate any storage for the array. Line 4 defines x[] to have 100 float components.

2 Copying x into its correct position The insert() method may have to move a lot of data. For example, if n = 1000 and x is less than all of those elements, then the method will move all 1000 elements. On average, inserting into a sorted array of n elements will move n/2 elements. So this is a 4(n) operation. Deleting an element is simply the reverse of the insertion process. It too will have to move n/2 elements, on average. So deletion is also a 4(n) operation. INDIRECT REFERENCE One solution to the data movement problem that is intrinsic to dynamic ordered arrays is to use an auxiliary index array to keep track of where the elements actually are.

8 If the sequential search is applied to an element that occurs more than once in an array, it will return the index of the one that is closest to the beginning of the array. 9 If the binary search is applied to an element that occurs more than once in an array, it could return the index of any one of them. It depends upon how close their indexes are to multiples of midpoints of subintervals. For example, if the binary search is applied in an array of 10,000 elements, searching for a value that is repeated at locations 0–99, the search would return the index 77 on the 7th iteration.