deletion will need to be shifted three spaces to see how this operation worksset the applet to dups ok and insert three or four items with the same key then try deleting them table shows the average number of comparisons and moves for the three operationsfirst where no duplicates are allowed and then where they are allowed is the number of items in the array inserting new item counts as one move table duplicates ok versus no duplicates no duplicates duplicates ok search insertion / comparisons no comparisonsone move comparisons no comparisonsone move deletion / comparisonsn/ moves comparisonsmore than / moves you can explore these possibilities with the array workshop applet the difference between and / is not usually considered very significantexcept when you're fine-tuning program of more importanceas we'll discuss toward the end of this is whether an operation takes one stepn stepslog(nstepsor steps not too swift one of the significant things to notice when you're using the array applet is the slow and methodical nature of the algorithms with the exception of insertionthe algorithms involve stepping through some or all of the cells in the array different data structures offer much faster (but more complexalgorithms we'll see onethe binary search on an ordered arraylater in this and others throughout this book the basics of arrays in java the preceding section showed graphically the primary algorithms used for arrays now we'll see how to write programs to carry out these algorithmsbut we first want to cover few of the fundamentals of arrays in java if you're java expertyou can skip ahead to the next sectionbut even and +programmers should stick around arrays in java use syntax similar to that in and +(and not that different from other languages)but there are nevertheless some unique aspects to the java approach