// this program demonstrates the Quicksort Algorithm. #include using namespace std; /1 Function prototypes void quicksort(int [, int, int); int partition (int [, int, int); void swap(int &, int &) int...

// this program demonstrates the Quicksort Algorithm. #include using namespace std; /1 Function prototypes void quicksort(int [, int, int); int partition (int [, int, int); void swap(int &, int &) int main() const int SIZE = 10; // Array size int count; int array [ SIZE] = {7, 3, 9, 2, 0, 1, 8, 4, 6, 5); Loop counter // Display the array contents. for (count 0; count