why would we want to arrange data in orderone advantage is that we can speed up search times dramatically using binary search start the ordered workshop appletusing the procedure described in you'll see an arrayit' similar to the one in the array workshop appletbut the data is ordered figure shows this applet figure the ordered workshop applet in the ordered array we've chosen not to allow duplicates as we saw earlierthis decision speeds up searching somewhat but slows down insertion linear search two search algorithms are available for the ordered workshop appletlinear and binary linear search is the default linear searches operate in much the same way as the searches in the unordered array in the array appletthe red arrow steps alonglooking for match the difference is that in the ordered arraythe search quits if an item with larger key is found try out linear search make sure the linear radio button is selected then use the find button to search for non-existent value thatif it were presentwould fit somewhere in the middle of the array in figure this number might be you'll see that the search terminates when the first item larger than is reachedit' in the figure the algorithm knows there' no point looking further try out the ins and del buttons as well use ins to insert an item with key value that will go somewhere in the middle of the existing items you'll see that insertion requires moving all the items with key values larger than the item being inserted