Example 61: Quicksort

Problem

Quicksort is a popular sorting method. The name comes from the fact that, in general, Quicksort can sort a list of data elements significantly faster than any other common sorting algorithms. This algorithm is based on the fact that it is faster and easier to sort two small arrays than one larger array. Thus, the basic strategy of Quicksort is to divide and conquer.

Write a program to sort an array in ascending order using the Quicksort algorithm.