Bubble Sort

#include <stdio.h>
#define N 1024

int main ()
{
  printf("hello world!\n");
  int row = 0;
  int column = 0;
  int array[N][N] = {};
  printf("请输入一个二维数组：\n");
  printf("请输入数组行数：\n");
  scanf("%d",&row);
  printf("请输入数组列数：\n");
  scanf("%d",&column);
  for(int i = 0;i<row;i++)
  {
      printf("请输入第%d行：\n",i+1);
      gets("%s",&array[i][]);
  }
  int a[][] = array[row][column];
  //bubble sort
  for(int i = 0;i<row;i++)
  {//row
    for(int j = 0;j<column-1;j++)
    {//column
      for(int k = i;column-1-j;k++)
      {//each time to compare
        int temp = 0;
        //exchange
        if(a[i][j]<a[i][j+1])
        {
          temp = a[i][j];
          a[i][j] = a[i][j+1];
          a[i][j+1] = temp;
        }
      }
    }  
  }
  printf("降序冒泡排列结果为：\n");
  for(int i = 0;i<row;i++)
  {
    puts(a[i][]);
    printf("\n");
  }
  return 0;
  //end
}