Quicksort is a sorting algorithm that is used to sort elements in an array. It was created by Tony Hoare in 1959, and it is still widely used today. Quicksort creates partitions within the array, essentially meaning that it splits the array into two parts, and then continues to split those parts into more parts, and sorting along the way. It does the actual sorting by nature of it being a comparison sort. This means that it chooses a pivot point in the array, and then compares it with all the other points in the array.