Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- int n;
- struct nod
- {
- int info;
- nod* leg;
- };
- nod*interclasare(nod*prim1,nod*prim2)
- {
- nod*p,*q,*r,*prim;
- if(prim1->info<prim2->info)
- {
- prim=prim1;
- p=prim1;
- q=prim2;
- }
- else
- {
- prim=prim2;
- p=prim2;
- q=prim1;
- }
- while(p->leg)
- if(p->leg->info<q->info)
- p=p->leg;
- else
- {
- r=p->leg;
- p->leg=q;
- p=r;
- swap(p,q);
- p->leg=q;
- }
- return prim;
- }
- void parcurgere(nod* v)
- {
- nod* c=v;
- while(c)
- {
- cout<<c->info<<" ";
- n++;
- c=c->leg;
- }
- }
- nod* creare2()
- {
- nod* prim, *ultim, *p;
- int nr;
- prim=new nod;
- ultim=prim;
- cout<<"Introduceti un numar: "; cin>>nr;
- if (nr==0)
- {
- cout<<"Lista este vida.";
- return 0;
- }
- else
- {
- prim->info=nr;
- prim->leg=NULL;
- cout<<"Introduceti un numar: "; cin>>nr;
- while(nr){
- p=new nod;
- p->info=nr;
- ultim->leg=p;
- ultim=p;
- ultim->leg=NULL;
- cout<<"Introduceti un numar: "; cin>>nr;
- };
- return prim;
- }
- }
- int main()
- {
- nod*prim1,*prim2,*prim;
- cout<<"Prima lista: ";
- prim1=creare2();
- cout<<"A doua lista: ";
- prim2=creare2();
- prim=interclasare(prim1,prim2);
- parcurgere(prim);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement