dsa algorithms

#include<stdio.h>

#include<stdlib.h>
struct node
{
int info;
struct node *link;
}*newnode,*start,*last,*temp;


void create()
{
int value,choice;
do{ struct node* newnode=(struct node*)malloc(sizeof(struct node));
printf("enter the vlaue");
scanf("%d",&value);
newnode->info=value;
newnode->link=NULL;
if(start==NULL)
{
start=newnode;
last=newnode;
}
else
{
last->link=newnode;
last=newnode;
last->link=NULL;
}
printf("1 to continue");
scanf("%d",&choice);
}
while(choice==1);
}


void display()
{
printf("\n your link list : ");
temp=start;
while(temp->link!=NULL)
{
printf("%d->",temp->info);
temp=temp->link;
}
printf("%d->",temp->info);
printf("NULL");
}
void main()
{
create();
display();
}