Sunteți pe pagina 1din 5

# 1 |Page

INSERTION SORT
Q. To perform Insertion Sorting using singly linked list, where the linked list (1)
might be empty, (2) might have a single node (3) might have more than one nodes.

Ans.

Algorithm:

Function insert
begin
P←getnode()
if (start=∆) then
begin
start←P
last←P
end
else if(info(start)>=info(P)) then
begin
start←P
end
else if(info(last)<=info(P)) then
begin
last←P
end
else
begin
prevx←start
begin
if(info(prev)>=info(P)) then
begin
break
end
2 |Page

end
end
end

Program in language C:

## /******************Insertion Sort using LINKED LIST****************/

#include<stdio.h>
#include<conio.h>
#include<alloc.h>
#include<process.h>
/***********************************************************/
struct node
{
int info;
struct node *next;
};
/***********************************************************/
typedef struct node N;
/***********************************************************/
N *start, *last, *temp, *prev, *prevx;
/***********************************************************/
void display()
{
if(start==NULL)
{
printf("Underflow. Press any key to continue...");
getch();
return;
}
temp=start;
printf("\nThe elements in the Linked List are:- ");
while(temp!=NULL)
{
printf("\t%d",temp->info);
temp=temp->next;
}
}
/***********************************************************/
void insert()
{
char ch;
do
{
temp=(N*)malloc(sizeof(N));
3 |Page

## printf("\n\nEnter the number: ");

scanf("%d",&temp->info);
if(start==NULL)
{
start=temp;
last=temp;
start->next=NULL;
last->next=NULL;
}
else if(start->info>=temp->info)
{
temp->next=start;
start=temp;
}
else if(last->info<=temp->info)
{
last->next=temp;
last=temp;
last->next=NULL;
}
else
{
prevx=start;
prev=start->next;
while(prevx->next!=NULL)
{
if(prev->info>=temp->info)
{
temp->next=prev;
prevx->next=temp;
break;
}
prev=prev->next;
prevx=prevx->next;
}
}
display();
printf("\n\nPress [Y] to insert again: ");
ch=getche();
}while(ch=='y'||ch=='Y');
}
/***********************************************************/
void main()
{
int ch;
clrscr();
printf("\n\n\t\t\t\tINSERTION SORT");
back:
4 |Page

printf("\n\t\t0> Exit.");
printf("\n\t\t1> Insert.");
printf("\n\t\t2> Display.\n\t");
printf("Choice: ");
scanf("%d",&ch);
if(ch==1)
insert();
if(ch==2)
display();
if(ch==0)
exit(0);
goto back;
}
/***********************************************************/

5 |Page