Professional Documents
Culture Documents
Liste
Liste
h>
#include <stdlib.h>
return nov;
}
if (poc->val > nov->val)
{
nov->next = poc;
return nov;
}
Cvor *pom;
pom=poc;
while((pom->next != NULL) && ((pom->next)->val < x))
{
pom = pom->next;
}
nov->next = pom->next;
pom->next = nov;
return poc;
}
Cvor *ubaci(Cvor *poc, int k, int x)
//ubacuje novi cvor na k-to mesto, tj.
ne ide do kraja liste, nego do k-tog cvora
{
Cvor *nov;
nov = (Cvor *)malloc(sizeof(Cvor));
nov->val = x;
nov->next = NULL;
if ((k == 0) || (poc == NULL))
{
nov->next = poc;
return nov;
}
int i=0;
Cvor *pom;
pom = poc;
while((i!=k-1) && (pom->next!=NULL))
{
pom=pom->next;
i++;
}
nov->next = pom->next;
pom->next = nov;
return poc;
}
void stampaj(Cvor *poc)
zato je void
{
Cvor *pom;
pom = poc;
while (pom!=NULL)
{
printf("%d\n", pom->val);
pom=pom->next;
}
}
int main()
{
Cvor *prvi;
int i,x,n,k;
prvi = NULL;
scanf("%d", &n);
for(i = 0; i<n; i++)
{
scanf("%d", &x);
prvi = dodajSort(prvi, x);
}
scanf("%d %d",&k, &x);
prvi = ubaci(prvi, k, x);
stampaj(prvi);
}