順序表存儲實現冒泡排序，選擇排序，插入排序，希爾排序，基數排序

#include<iostream> using namespace std; const int MAXSIZE = 100; typedef int ElemType; struct Data { ElemType key; // int shu; int point; }; //Data ar[MAXSIZE], br[MAXSIZE]; int yx(int m,

>>阅读原文<<