maopao.cpp

来自「数据结构中的一个实验报告的源程序：交换冒泡排序算法源代码」· C++ 代码 · 共 54 行

#define MAXSIZE 20
#include <stdio.h>
//typedef int KeyType;
typedef struct
{ int key;//KeyType key;
}Arraytype;
typedef struct
{  Arraytype r[MAXSIZE+1];
  int length;
}array;//sqlist;
void Createsqlist(array &L)//创建列表
{ int i;
  printf("\nPlease Input the length of the Array ");
  scanf("%d",&L.length);
   printf("\nPlease Input the datas of the Array ");
  for(i=1;i<=L.length;i++)
   {
     scanf("%d",&L.r[i].key);
  }
printf("\nBefore sorting排序前 :\n");//输出未排序的序列
for(i=1;i<=L.length;++i)
printf("%-3d ",L.r[i].key);
}                                   /*END InitKey*/
void BubbleSort(array &L)          //进行排序
{int i,j;
 for(j=L.length;j>=3;j--)
   {for(i=1;i<j;i++)
      {if(L.r[i].key>L.r[i+1].key)
 {  L.r[0].key=L.r[i].key;
    L.r[i].key=L.r[i+1].key;
    L.r[i+1].key=L.r[0].key;}
      }
   }
}
void Output(array &L)/*打印排序结果*/
{  int i;
  printf("\nAfter sorting 排序后:\n");
  for(i=1;i<=L.length;++i)
    printf("%-3d ",L.r[i].key);
  printf("\noutput.txt:\nAfter sorting,the subject gives the printlning :\n");
  for(i=1;i<=2;++i)
    printf("%-3d ",L.r[i].key);
    printf("\n");
}
void main()               //主函数
{ printf("\n The process has been modified by shelley!\ninput.txt:");
 array array_L;
 Createsqlist(array_L);
 BubbleSort(array_L);
 Output(array_L);
 getchar();
 getchar();
}