C程式：矩陣元素排序

Requirement：

編寫一程式，把M×N矩陣a的元素逐列按降序排列。假設M、N不超過10。分別編寫求一維數組元素值最大和元素值最小的函數，主函數中初始化一個二維數組a[10][10]，調用定義的兩函數輸出每行、每列的最大值

代碼：

// MatrixSort.cpp : Defines the entry point for the console application.//#include "stdafx.h"#include iostream.h>void bubble_sort(int a[],int n){    int temp=0;    for( int i=0;in;i++ )    for(int j=n-1;j>i;j--)    {        if(a[i]a[j])        {            temp=a[i];            a[i]=a[j];            a[j]=temp;        }    }}void bubble_sort2(int** a,int n){    int temp=0;    for( int i=0;i )    for(int j=n-1;j>i;j--)    {        if(**(a+i)**(a+j))        {            temp=**(a+i);            **(a+i)=**(a+j);            **(a+j)=temp;        }    }}void formatMatrix(int* matrix, int linesize , int columnsize){for(int j=0 ; jcolumnsize ; j++){int** col = new int*[linesize] ;for(int i=0 ; ilinesize ; i++ )*(col+i) = matrix+i*columnsize+j;bubble_sort2(col ,linesize ) ;delete[] col ;}}void showMaxAndMin(int* matrix, int linesize , int columnsize){int* max = new int[columnsize] ;int* min = new int[columnsize] ;for (int i=0; icolumnsize; i++){max[i] = *(matrix+i) ;min[i] = *(matrix+(linesize-1)*columnsize+i) ;}coutendl ;coutMin value: " ;for (int j=0; jcolumnsize; j++){coutmin[j]coutendl ;coutMax value: " ;for (int k=0; kcolumnsize; k++){coutmax[k]coutendlendl ;delete[] max ;delete[] min ;}int main(int argc, char* argv[]){int a[5][5] = {{1,3,8,2,4},{5,2,8,9,3},{4,1,6,0,7},{3,0,1,2,5},{8,3,0,8,4},} ;// Calculate linesize and columnsize of matrixint columnsize = sizeof(a[0])/sizeof(int) ;int linesize = sizeof(a)/sizeof(int)/columnsize ;coutColumn Size="Line Size=" " ;}coutendl ;}//Print min and max values for each columnshowMaxAndMin(*a, linesize, columnsize) ;return 0;}