快速与归并排序（国外英文资料）.docVIP

快速与归并排序（国外英文资料） # include stdio, h # include stdlib. H # define the ERROR 0 1 # define TRUE 1 # define OK # define STACK_INIT_SIZE 100 / / stacks storage space initial allocation # define STACKINCREMENT 10 / / stack space allocation increment Typedef int SElemType; Typedef int the Status; / / define the structure to store the data Typedef struct { Int * element; / / storage space base Int ELenght; / / the number of storage capacity that is currently allocated } SqLint; / / construct an empty linear table L Int InitSqlint (SqLint L) {. (L.e.) / / allocate storage space If (! L.e) return 0; / / verify that the allocation is successful and the allocation failure returns 0 Return 1; / / allocation success returns 1 } / / InitSqlint / / to table L.e Void Assignment (SqLint L) {. Int I; Printf ( please enter % d plastic data as the element \ n , L.E Lenght); For (I = 0; I L.E Lenght; I + +) / / the input from the keyboard is assigned to the table l. e Scanf ( % d ); } / / the L.E Lenght element in the output table Void the Output (SqLint L) { Int I; For (I = 0; I L.E Lenght; I + +) / / will output the L.E Lenght from the first one to the display Printf ( % d ); } Typedef struct { SElemType * base; / / the base value is NULL before and after the stack construction SElemType * top; / / stack top pointer Int stacksize; / / currently allocated storage space, in element units } SqStack; / / the initialization of the stack Status InitStack (SqStack S) { / / construct an empty stack S S.b ase = (SElemType *) malloc (SElemType); If (! S.ase) return ERROR; / / the storage space failed S.t op = S.b ase; S.s tacksize = STACK_INIT_SIZE; Return OK; } / / InitStack / / into the stack Status Push (SqStack S, SElemType e) / / insert element e is the new stack top element If (s.t.op -s.b), the stack is full, additional storage space SElemType *) realloc (S.s.) If (! S.ase) return ERROR; / / storage allocation failure S.t.op. S.s tacksize + = STACKINCREMENT; } * s + + = e; Return