Find minimum element in linked list by R4R Team

Example-
linked list is 2->3->6->1->0
Min is 0

program-

#include< stdio.h>
#include< conio.h>
#include< alloc.h>
struct node{
struct node *link;
int data;
};
struct node *first=NULL;
void minimum(struct node *ptr)
{
int min=ptr->data;
while(ptr!=NULL)
{
if(ptr->data< min)
min=ptr->data;
ptr=ptr->link;
}
printf("Minimum in linklist is %d",min);
}

void main()
{
struct node *cpt,*ptr;
char ch;
clrscr();
first=(struct node*)malloc(sizeof(struct node));
printf("Enter first element in Linklist\n");
scanf("%d",&first->data);
ptr=first;
do
{
cpt=(struct node*)malloc(sizeof(struct node));
printf("Enter another data\n");
scanf("%d",&cpt->data);
ptr->link=cpt;
ptr=ptr->link;
printf("Continue(y/n) ?");
ch=getch();
}while(ch=='y');
ptr->link=NULL;
minimum(first);
getch();
}


output-

Enter first element in Linked list
2
Enter another data
4
Continue(y/n)?
Enter another data
1
Continue(y/n) ?
Enter another data
9
Continue(y/n) ?
Enter another data
0
Continue(y/n) ?
Minimum in Linked list is 0




Leave a Comment: