Sorting-fast sorting (three numbers are exchanged between China and France and optimization is not necessary), and three numbers are in France.

Sorting-fast sorting (three numbers are exchanged between China and France and optimization is not necessary), and three numbers are in France.

# Include <iostream> # include <stdlib. h> using namespace std; # define MAXSIZE 10 void swap (int k [], int low, int high) {int temp; temp = k [low]; k [low] = k [high]; k [high] = temp;} int Partition (int k [], int low, int high) {int point; int m = low + (high-low)/2; if (k [low]> k [high]) {swap (k, low, high );} if (k [m]> k [high]) {swap (k, m, high);} if (k [m]> k [low]) // enables low to store the Intermediate Value {swap (k, m, low);} point = k [low]; while (low