软件设计4.pptVIP

All things are easy to industry； all things difficult to sloth． 勤劳诸事易，懒惰万事难。 Lost wealth can be replaced by industry，lost knowledge by study，lost health by temperance or medicine，but lost time is gone forever. ．失去的财富可由勤奋而恢复，失去的知识可由学习而恢复，失去的健康可由节制或药物而恢复，但失去的时间一去永不复返。 link stack Application cases:The maximum capacity of stack can not be estimated ahead of schedule, link stack can be used as storage structure,with the stack top pointer—top.If top==0,then the stack is empty. Datatype description #define DATATYPE2 char Typedef struct snode {DATATYPE2 data; struct snode *next; } LINKSTACK; Operations on stack (1)push stack LINKSTACK *push(LINKSTACK *s,DATATYPE2 x) {LINKSTACK *; p=malloc(sizeof(LINKSTACK)); p-data=x; p-next=top; top=p; return p; } Operations on stack (2) pop stack LINKSTACK *push(LINKSTACK *top, DATATYPE2 *v) {LINKSTACK *p; if( top==null) printf (“underflow\n”); else {*v=top-data; p=top; top=top-next; free(p); } return top; } Stack application cases 1、 the transformation of non-negative decimal data into octonary or binary data. 2 、the in-turn treatment of matching parentheses . 3、 the use of nested proceed . 4 、recursive call. 5 、expression evaluation . Stack application cases The transformation of non-negative decimal data into octonary or binary data. Note: use stack ,firstly ,the decimal data is to be divided by the base number 8,the gained residual number will be pushed into the stack;,then the next residual number which is gained by the above quotient divided by 8 is also to be pushed into this stack,such procedure goes on until the quotient equals to zero(0);finally,the gained result is the data that are to be popped out of the stack. .e. g. (80)10=(120)8 Void d-to-o(unsigned x ) {SEQSTACK stack, *s ; s=stack; Initstack(s); Push(s, ‘#’); While(x! =0) {push(s, x%8); x=x/8;} While (gettop(s)!=‘#’) Printf (“%d”,pop(s)); } Th