public cts Node t next ni next Solutionvoid sort inode ptr

Solution

void sort()
{
inode *ptr, *s;
int value;
if (start == NULL)
{
cout<<\"The List is empty\"<<endl;
return;
}
ptr = start;
while (ptr != NULL)
{
for (s = ptr->next;s !=NULL;s = s->next)
{
if (ptr->info > s->info)
{
value = ptr->info;
ptr->info = s->info;
s->info = value;
}
}
ptr = ptr->next;
}
}