The quicksort trap on an already sorted list

Quicksort is a very efficient sorting algorithm on average that can nevertheless prove disastrous. This failure occurs when the first element is chosen as the pivot and it is applied to a list of values already sorted. It is therefore advisable to avoid this usage or to choose the pivot randomly so that the program functions correctly.