[Verse 1] Function quicksort takes the list L. If L if the length of L is less than 2 then return the list as it is already sorted. [Verse 2] Let pivot be a random element from the list. [Verse 3] Partition the list into three sublists L, E, and G: Elements less than, equal to and greater than the pivot. [Verse 4] Recursively apply the quicksort algorithm to sublists L and G. [Verse 5] Concatenate the sorted sublists and return the concatenated list as the sorted result.