Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- int max(Stack *S){
- int max_=StTop(*S);
- Queue moj_red;
- QuMakeNull(&moj_red);
- while(StEmpty(*S)!=!){
- if(StTop(*S)>max_)
- max_=StTop(*S);
- QuEnqueue(StTop(*S), &moj_red);
- StPop(*S);
- }
- while(QuEmpty(moj_red)!=1){
- if(max_!=QuFront(moj_red))
- StPush(QuFront(moj_red), S);
- QuDequeue(&moj_red);
- }
- }
- //B DIO
- void SortMax(Stack* S){
- int max_;
- Queue moj_red;
- QuMakeNull(&moj_red);
- while(StEmpty(*S)!=1){
- max_=max(S);
- QuEnqueue(max, &moj_red);
- }
- while(QuEmpty(moj_red)!=1){
- StPush(QuFront(moj_red), S);
- QuDequeue(&moj_red);
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement