#include<iostream.h> #include<conio.

h>

struct nod {int info; nod* next; };

nod *p,*u;

void cre_ord(int x) //creare lista ordonata {nod *c,*a; c=new nod; c->info=x; if(!p)//test lista vida {p=new nod; p->info=x; u=p; u->next=0; } else if(x<=p->info)//inserare inainte de primul {c->next=p; p=c;} else if(x>u->info)//dupa ultimul {u->next=c; u=c; u->next=0;} else //in interior

{ a=p; while(x>a->next->info) a=a->next; c->next=a->next; a->next=c; } }

void afisare() {nod *c; c=p; cout<<endl<<"continutul listei "<<endl; while(c) {cout<<c->info<<" "; c=c->next;} }

void main() {int n,y; clrscr(); cout<<"nr de noduri "; cin>>n; for(int i=1;i<=n;i++) {cout<<"informatia "; cin>>y; cre_ord(y); } afisare(); getch();