Does the following Quicksort partitioning algorithm result in a stable sort (i.e. does it maintain the relative position of elements with equal values):
pa
From Wikipedia:
Quicksort is a comparison sort and, in efficient implementations, is not a stable sort.