[Verse 1] Check if the list is empty or contains a single element. If so, return the list as it is already sorted. [Verse 2] Select a pivot element from the list. [Verse 3] Partition the list into three sublists: Elements less than the pivot. Elements equal to the pivot. Elements greater than the pivot. [Verse 4] Recursively apply the quicksort algorithm to the sublist of elements less than the pivot. [Verse 5] Recursively apply the quicksort algorithm to the sublist of elements greater than the pivot. [Verse 6] Concatenate the sorted sublist of elements less than the pivot, the sublist of elements equal to the pivot, and the sorted sublist of elements greater than the pivot. [Verse 7] Return the concatenated list as the sorted result.