LL_Bubble_sort.c

#include<stdio.h>
#include<stdlib.h>
#include <stddef.h>

struct node
{
  int data;
  struct node *next;
};

struct node *start=NULL;
struct node * create_ll(struct node *);
struct node * display(struct node *);
struct node * sort_list(struct node *);

void main()
{

printf("create your Linked List");  
start=create_ll(start);
printf("\n link list created");


printf("\n\nLinked list :");

start=display(start);

printf("\n\nSorted Linked List:");


start=sort_list(start);
start=display(start);
printf("\n");








}

struct node * create_ll(struct node *start)
{

  struct node *new_node,*ptr;
  int num;
  printf("\n Enter -1 to end\n");
  
  scanf("\n%d",&num);

  while(num != -1)
  {

   new_node=(struct node *)malloc(sizeof(struct node));
   new_node->data=num;

   if(start==NULL)
   {
     new_node->next=NULL;
     start=new_node;
   }
   else
   {

     ptr=start;

     while(ptr->next != NULL)
        ptr=ptr->next;

     ptr->next=new_node;
     new_node->next=NULL;
    }
    
    scanf("%d",&num);
   }
 return start;
}

struct node * display(struct node *start)
{
  struct node *ptr;
  ptr=start;

  while(ptr != NULL)
  {

    printf("\t %d",ptr->data);
    ptr=ptr->next;
  }
  return start;
}

struct node * sort_list(struct node *start)
{
  struct node *ptr1,*ptr2;
  int temp;

  ptr1=start;
 
  while(ptr1->next != NULL)
  {

    ptr2=ptr1->next;

    while(ptr2 !=NULL)
    {

      if(ptr1->data > ptr2->data)
      {
        temp=ptr1->data;
        ptr1->data=ptr2->data;
        ptr2->data=temp;
      }
      ptr2=ptr2->next;
    }
  ptr1=ptr1->next;
 }
 return start;
}