divide impera (mergefigure merge sort divide et impera approach quick sort quick sort is one of the most popular sorting algorithms based on divide et impera strategyresulting in an ( log ncomplexity the algorithm starts by picking an itemcalled pivotand moving all smaller items before itwhile all greater elements after it this is the main quick sort operationcalled partitionrecursively repeated on lesser and greater sub lists until their size is one or zero in which case the list is implicitly sorted choosing an appropriate pivotas for example the median element is fundamental for avoiding the drastically reduced performance of (