STL:<stack> container

For using stack container we have to include <stack> in our program.We already know that stack is last in first out system.Mainly stack has two operations 1.push operation & 2.pop operation.

There are 5 member functions in the <stack> container.They are:

Suppose x is a stack

1.x.push(value);//for inserting a value in stack.

2.x.pop();//for removing the top element.

3.x.top();returns the top element of the stack.

4.x.empty();returns a boolean value that the is empty or not.

5.x.clear();for removing the entire stack.

SORTING A LINKED LIST

/*******************
linked list
bubble sort
complexity:O(n^2)
*******************/
#include <bits/stdc++.h>

using namespace std;

class linked_list
{
    public:
    int data;
    class linked_list *next;
};
typedef linked_list node;

void show(node *p){

    while(p){
        cout<<p->data<<" ";
        p=p->next;
    }
    cout<<endl;
    return;
}
void sort(node *p)
{
    while(p->next){
        node *test=p->next;
        while(test){
            if(test->data<p->data)
                swap(test->data,p->data);
            test=test->next;
        }
        p=p->next;
    }
}
void create(node *p){

    char c;
    scanf("%d%c", &p->data, &c);

    if(c=='\n')
        p->next=NULL;
    else
    {
        p->next=new node;
        create(p->next);
    }
    return;
}

int main(){

    bool x;
    while(cin>>x){

        node *head;
        head=new node;
        create(head);
        cout<<"list before sorting\n";
        show(head);
        sort(head);
        cout<<"list after sorting\n";
        show(head);
    }
    return 0;
}