The quick sort partitions objects into two groups, one group of the objects with a value above a certain value, and another group with a value below.  Each of these groups is further divided, and this action continues recursively until … Continue reading →