of the listthe median of three will choose better "middlevalue this will be particularly useful when the original list is somewhat sorted to begin with we leave the implementation of this pivot value selection as an exercise self check given the following list of numbers [ which answer shows the contents of the list after the second partitioning according to the quicksort algorithm [ [ [ [ given the following list of numbers [ what would be the first pivot value using the median of method which of the following sort algorithms are guaranteed to be ( log neven in the worst case shell sort quick sort merge sort insertion sort summary sequential search iso(nfor ordered and unordered lists binary search of an ordered list is (log nin the worst case hash tables can provide constant time searching bubble sorta selection sortand an insertion sort are ( algorithms shell sort improves on the insertion sort by sorting incremental sublists it falls between (nand ( merge sort is ( log )but requires additional space for the merging process quick sort is ( log )but may degrade to ( if the split points are not near the middle of the list it does not require additional space summary