arrays binary searches require time proportional to the logarithm of the number of items big notation provides convenient way to compare the speed of algorithms an algorithm that runs in ( time is the besto(log nis goodo(nis fairand ( is pretty bad questions these questions are intended as self-test for readers answers may be found in appendix inserting an item into an unordered array takes time proportional to the size of the array requires multiple comparisons requires shifting other items to make room takes the same time no matter how many items there are true or falsewhen you delete an item from an unordered arrayin most cases you shift other items to fill in the gap in an unordered arrayallowing duplicates increases times for all operations increases search times in some situations always increases insertion times sometimes decreases insertion times true or falsein an unordered arrayit' generally faster to find out an item is not in the array than to find out it is creating an array in java requires using the keyword if class is going to use class for somethingthen class ' methods should be easy to understand it' preferable if class communicates with the program' user the more complex operations should be placed in class the more work that class can dothe better when class is using class for somethingthe methods and fields class can access in class are called class '