守护生命的绿荷的专栏

#include #include #include using namespace std; #include typedef int ElemType; typedef struct Node { int id; ElemType data; }A; A a[100]; bool cmp(A a,A b) { return a.data<b.data; }

#include //#include using namespace std; /*方法一: int Partion(int a[],int low,int high) { int pivotkey=a[low]; while(low<high) { while(low=pivotkey) { --high;

#include #include #include using namespace std; #define LIST_INIT_SIZE 100 #define LISTINCREMENT 10 typedef int ElemType; typedef struct { ElemType *elem; //线性表的基地址 int length; //当前长度

#include #include #include #include using namespace std; typedef int ElemType; typedef struct LNode { ElemType data; struct LNode *next; }LNode,*LinkList; int GetElem_L(LinkList L,int i,Ele