Quicksort

Quicksort is a fast and efficient ordering method, invented by Charles Antony, a British computer scientist. It follows 3 main steps:
1 - chooses an element from the list called a pivot;
2 - part the list into two sub-lists, one list with the elements greater than the pivot and the other with the elements lesser than the pivot;
3 - recursively order the sublists

How to use quicksort.go?

go run quickSort.go 4 3 2 1

output

1 2 3 4