Description

To sort elements of singly linked list - 
Case 1: Check if list is empty 
	Show message that list is empty.
Case 2: If list has only one elements
	Linked List is already sorted.
Case 3: If list has more than one elements
	Follow the bubble sort algorithm to sort the elements of list.

Note: Here head contains the address of first node

C/C++

/* C Program To Sort the elements using Bubble Sort singly linked list */
//Save it as sort_bubble_singly_linked_list.c

#include<stdio.h>
#include<malloc.h>
struct node *create(int);
void display(struct node *);
struct node *sort_list(struct node *);

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

int main(){
    int n;
    struct node *head;
    printf("Enter number of nodes : ");
    scanf("%d",&n);
    
    //Calling function to create node
    head=create(n);
    
    //Calling function to display list
    display(head);
    
    //Code to sort the linked list using bubble sort
    head=sort_list(head);
    printf("\nThe linked list after sorting using bubble sort - \n");
    
    //Calling function to display list after sorting of list using bubble sort
    display(head);

    return 0;
}

struct node *create(int n){
    int i;
    struct node *head=NULL;
    struct node *address,*newNode;

    for(i=0;i<n;i++){
        
        //Creating a new node
        newNode=(struct node*)malloc(sizeof(struct node*));
        
        //Assigning data to newly created node
        printf("Enter the value of %d node : ",i+1);
        scanf("%d",&newNode->data);
        newNode->next=NULL;
        
        /*If list is empty assign the address of newly created node to head*/
        if(head==NULL){
            head=newNode;
        }else{
            
            /* If list already have few elements then loop through
            list and add newly created node after given node*/
            address=head;
            while(address->next!=NULL){
                address=address->next;
            }
            address->next=newNode;
        }
    }
    return head;
}

void display(struct node *head){
    struct node *address;
    
    //If list is empty
    if(head==NULL){
        printf("The linked list is empty");
    }else{
        
        /*If list has elements then loop through the loop and
        print elements one by one in sequential manner*/
        address=head;
        while(address!=NULL){
            printf("The node value = %d and their address = %u\n",address->data,address);
            address=address->next;
        }
    }
}

//Function for sorting the elements of list
struct node *sort_list(struct node *head){
    int temp;
    struct node *address, *nextAddress;
    address=head;
    
    //If list has no any nodes
    if(head==NULL){
        printf("\nThe Linked List is empty..No Node for sorting");
    }
    
    //If list has only one elements
    else if(head->next==NULL){
        printf("\nThe Linked List has only one element..");
    }
    
    //If list has more than one elements
    else{
        while(address->next!=NULL){
            nextAddress=address->next;
            while(nextAddress!=NULL){
                if(address->data > nextAddress->data){
                    temp=address->data;
                    address->data=nextAddress->data;
                    nextAddress->data=temp;
                }
                nextAddress=nextAddress->next;
            }
            address=address->next;
        }
    }
    return head;
}

Input:
Enter number of nodes : 3
Enter the value of 1 node : 4
Enter the value of 2 node : 2
Enter the value of 3 node : 9

Output:
The node value = 4 and their address = 7081296
The node value = 2 and their address = 7081328
The node value = 9 and their address = 7081344

The linked list after sorting using bubble sort -
The node value = 2 and their address = 7081296
The node value = 4 and their address = 7081328
The node value = 9 and their address = 7081344

Java

/* Java Program To Sort the elements using Bubble Sort singly linked list */
//Save it as SortBubbleSinglyLinkedList.java

import java.io.*;
import java.util.Scanner;

public class SortBubbleSinglyLinkedList {
    
    // Declaring node
    class Node {
        int data;
        Node next;

        public Node(int data) {
            this.data = data;
            
            // Assigning null value to the next field
            this.next = null;
        }
    }

    public Node head = null;
    
    // Function to add node
    public void addNode(int data) {
        
        // Creating a new node
        Node newNode = new Node(data);
        
        /* If list is empty assign the address of newly created node to head */
        if (head == null) {
            head = newNode;
        } else {
            
            /*
             * If list already have few elements then loop through list and
             */
            Node ptr = head;
            while (ptr.next != null) {
                ptr = ptr.next;
            }
            ptr.next = newNode;
        }
    }

    public void display() {
        Node ptr = head;
        
        // If list is empty
        if (ptr == null) {
            System.out.println("The list is empty");
            return;
        }
        System.out.println("The nodes of lists are : ");
        
        /*
         * If list has elements then loop through the loop and print elements one by one
         * in sequential manner
         */
        while (ptr != null) {
            System.out.print(ptr.data + " ");
            ptr = ptr.next;
        }
    }

    public static void main(String[] args) {

        Scanner scanner = new Scanner(System.in);

        SortBubbleSinglyLinkedList list = new SortBubbleSinglyLinkedList();

        System.out.println("Enter number of node you want to enter : ");
        int n = scanner.nextInt();

        for (int i = 0; i < n; i++) {
            System.out.println("Enter value of " + (i + 1) + " node : ");
            int val = scanner.nextInt();
            list.addNode(val);
        }
        
        // Calling function to display list
        list.display();

        list.sort_list();
        
        // Calling function to display list after sorting the elements using bubble sort
        System.out.println("\nAfter sorting the elements using bubble sort - ");
        list.display();
    }
    
    //Method for sorting the elements of list
    private void sort_list() {
        int temp;
        Node address, nextAddress;
        address=head;
        
        //If list has no any nodes
        if(head==null){
            System.out.println("The Linked List is empty..No Node for sorting");
        }
        
        //If list has only one elements
        else if(head.next==null){
            System.out.println("\nThe Linked List has only one element..");
        }
        
        //If list has more than one elements
        else{
            while(address.next!=null){
                nextAddress=address.next;
                while(nextAddress!=null){
                    if(address.data > nextAddress.data){
                        temp=address.data;
                        address.data=nextAddress.data;
                        nextAddress.data=temp;
                    }
                    nextAddress=nextAddress.next;
                }
                address=address.next;
            }
        }
    }
}

Input:
Enter number of node you want to enter : 
5
Enter value of 1 node : 
2
Enter value of 2 node : 
1
Enter value of 3 node : 
7
Enter value of 4 node : 
3
Enter value of 5 node : 
9

Output:
The nodes of lists are : 
2 1 7 3 9 
After sorting the elements using bubble sort - 
The nodes of lists are : 
1 2 3 7 9

Related Programs