An
animated image demonstrating the
Quicksort
algorithm used to sort a list of items in
computer programming. First, a
pivot is selected from the list, then the list is partitioned so that the values greater than the pivot come after it and those of lower value come before it. This act is
recursively performed until the entire list is sorted.Image credit:
RolandH
An
animated image demonstrating the
Quicksort
algorithm used to sort a list of items in
computer programming. First, a
pivot is selected from the list, then the list is partitioned so that the values greater than the pivot come after it and those of lower value come before it. This act is
recursively performed until the entire list is sorted.Image credit:
RolandH