Which implementation has the worst space complexity?

Quicksort (sometimes called partition-exchange sort) is an efficient sorting algorithm, serving as a systematic method for placing the elements of a random access file or an array in order. Developed by British computer scientist Tony Hoare in 1959[1] and published in 1961,[2] it is still a commonly used algorithm for sorting. When implemented well, it can be about two or three times faster than its main competitors, merge sort and heapsort.[3][contradictory]

Hdi4nfnfuhdjdurjfjc7fjrnckf snuck fhfjfkfmfjfk4jrhr

Just trying to get some points : p sorry bro