Bubble Sort On Linked List

/* C++ Program to perform bubble sort on linked list */
#include<iostream>
using namespace std;

/* Structure of Node of the Linked List */
struct node
{
    int data;
    struct node *next;
};

/* Function to Insert Node at the End of the Linked List */
void insert_end(struct node **head, int ele)
{
    /* Creating a Node */
    struct node *new_node;
    new_node = (struct node*)malloc(sizeof(struct node));
    new_node->data = ele;
    new_node->next = NULL;
    
    /* Check whether the linked list is empty or not */
    
    /* If Linked List is empty, then new node will become head of the linked list */
    if(*head == NULL) 
    {
        *head = new_node;
        return;
    }
    
    /* If Linked List is not empty, then traverse the complete linked list and point the
    pointer of last node of the linked list to the new node of the linked list */
    struct node *temp = NULL;
    temp = (*head);
    while(temp->next != NULL)
    temp=temp->next;
    temp->next = new_node;
}

/* Function to Sort the Linked List using Bubble Sort */
void bubbleSort(struct node *head)
{
    struct node *temp1;
    struct node *temp2;
    for(temp1 = head; temp1!=NULL; temp1=temp1->next)
    {
        for(temp2 = temp1->next; temp2!=NULL; temp2=temp2->next)
        {
            if(temp1->data > temp2->data)
            {
                int temp = temp1->data;
                temp1->data = temp2->data;
                temp2->data = temp;
            }
        }
    }
}

/* Function to Print the Linked List */
void print(struct node *head)
{
    struct node *p = head;
    while(p!=NULL)
    {
        cout<<p->data<<" ";
        p=p->next;
    }
}
int main()
{
    struct node *head;
    head = NULL;
    /* Inserting Some Nodes of the Linked List */
    insert_end(&head,4);
    insert_end(&head,3);
    insert_end(&head,2);
    insert_end(&head,1);
    cout<<"The linked list elements before sorting:\n";
    print(head);
    bubbleSort(head);
    cout<<"\n The linked list elements after sorting:\n";
    print(head);
}