17-week Project 5: array sorting

/** Copyright and version declaration section of the Program * Copyright (c) 2012, student * All rightsreserved from computer College of Yantai University. * file name: array. cpp * Author: Li Yang * Completion Date: July 15, December 22, 2012 * version: v1.0 ** input Description: none * Problem description: array sorting */# include <iostream> using namespace std; void sort (int * p, int num); // do not modify the declaration of the custom function void output (int *, int); int main () // do not make any changes to the main function {int a [20] = }; int B [15] = {,}; sort (a, 20 ); // use the Bubble Method to sort the output (a, 20) elements in a in descending order; // output the sorted array sort (B, 15 ); // sort the elements output (B, 15) in B in descending order by bubble; // return 0;} void sort (int * p, int num) {int I, j, k, t; for (I = 0; I <num-1; I ++) {k = I; for (j = I + 1; j <num; j ++) if (* (p + j)> * (p + k) k = j; t = * (p + k ); * (p + k) = * (p + I); * (p + I) = t;} void output (int * p, int n) {int I; for (I = 0; I <n; I ++) cout <* (p + I) <"; cout <endl ;}