halves as they are extracted with the slicing operations this additional space can be critical factor if the list is large and can make this sort problematic when working on large data sets self check given the following list of numbers[ which answer illustrates the list to be sorted after recursive calls to mergesort [ [ [ [ given the following list of numbers[ which answer illustrates the first two lists to be merged [ and [ [[ and [ [ and [ [ and [ the quick sort the quick sort uses divide and conquer to gain the same advantages as the merge sortwhile not using additional storage as trade-offhoweverit is possible that the list may not be divided in half when this happenswe will see that performance is diminished quick sort first selects valuewhich is called the pivot value although there are many different ways to choose the pivot valuewe will simply use the first item in the list the role of the pivot value is to assist with splitting the list the actual position where the pivot value belongs in the final sorted listcommonly called the split pointwill be used to divide the list for subsequent calls to the quick sort figure shows that will serve as our first pivot value since we have looked at this example few times alreadywe know that will eventually end up in the position currently holding the partition process will happen next it will find the split point and at the same time move other items to the appropriate side of the listeither less than or greater than the pivot value figure the first pivot value for quick sort sorting