4 - Algorithms GapFill

Different search algorithms play to different strengths.   BinaryMergeLinearBubble searches, which have a time complexity of   O(n^2)O(nlog n)O(n)O(log n), begin at one end of a data structure, and iterate over it until the search term is found or all data items have been found.  This is a useful algorithm for   unsortedalphabeticnumericsorted data, unlike   mergebinarylinearbubble searches, which begin   at the left endat the right endat the largest data itemin the middle.  Though more complex to code, this algorithm has time complexity of   O(n^2)O(nlog n)O(n)O(log n), and it only works on   alphabeticnumericunsortedsorted data.