ordered arrayscompared with unordered arraysare much quicker at deletion quicker at insertion quicker to create quicker at searching logarithm is the inverse of the base logarithm of , is the maximum number of elements that must be examined to complete binary search in an array of elements is the base logarithm of is true or falsethe base logarithm of is big notation tells how the speed of an algorithm relates to the number of items the running time of an algorithm for given size data structure the running time of an algorithm for given number of items how the size of data structure relates to the number of items ( means process operates in time either variables of primitive types or can be placed in an array experiments carrying out these experiments will help to provide insights into the topics covered in the no programming is involved use the array workshop applet to insertsearch forand delete items make sure you can predict what it' going to do do this both when duplicates are allowed and when they're not make sure you can predict in advance what range the ordered workshop applet will select at each step