#include<iostream>
using namespace std;

struct node
{
	int data ;
	node * next ;
};

class list
{
	private : 
	node *head ;
	public : 
	list()
	{
		head = NULL ;
	}
	void add(int x)
	{
		node *t = head;
		node * temp = new node();
		temp -> data = x ;
		if(t==NULL)
		{
			temp->next = NULL;
			head = temp ;
		}
		else
		{	
			while(t->next !=NULL)
			{	
				t = t->next ;
			}
			temp->next = t->next ;
			t->next = temp ;
		}
		return ;
	}
	void sort()
	{
		int a , b , pos=1 , i ;
		node *t = head ;
		node *p ;
		while(1)
		{
			p = head ;
			a = t->data ;
			t = t->next ;
			if(t==NULL)
				break ;
			b = t->data ;
			if(b<a)
			{
				i=pos ;
				while(p->data < b)
				{
					p = p->next;
					i--;
				}
				while(i--)
				{
					a = p->data ;
					p->data = b ;
					b=a ;
					p = p->next ;
				}
				p->data = b ;
			}
			pos++ ;
		}
	}
	void print()
	{
		node * t = head ;
		while(t!=NULL)
		{
			cout << t->data << " " ;
			t = t->next;
		}
	}
};

int main()
{
	list l ;
	int a ; 
	char ch = 'y' ;
	while(ch=='y')
	{
		cout << "Enter a number : ";
		cin >> a ;
		l.add(a);
		cout << "Enter another number ? : ";
		cin >> ch ;
	}
	cout << "List is : " ; l.print();
	l.sort();
	cout << "\nSorted list is : " ; l.print();
	return 0 ;
}