ReverseLL.c

#include <stdio.h>  
struct node{  
    int data;  
    struct node *next;  
};*head, *tail = NULL;  
   
void createNode(int data){  
    struct node *newNode = (struct node*)malloc(sizeof(struct node));  
    newNode->data = data;  
    newNode->next = NULL;  
      
    if(head == NULL) {  
        head = newNode;  
        tail = newNode;  
    }  
    else {  
        tail->next = newNode;  
        tail = newNode;  
    }  
}  
void sortList() {  
    struct node *current = head, *index = NULL;  
    int temp;  
          
    if(head == NULL) {  
        return;  
    }  
    else {  
        while(current != NULL) {  
            index = current->next;  
                  
            while(index != NULL) {  
                if(current->data > index->data) {  
                    temp = current->data;  
                    current->data = index->data;  
                    index->data = temp;  
                }  
                index = index->next;  
            }  
            current = current->next;  
        }      
    }  
}  
void display() {  
    struct node *current = head;  
    if(head == NULL) {  
        printf("List is empty \n");  
        return;  
    }  
    while(current != NULL) {  
        printf("%d---->", current->data);  
        current = current->next;  
    }
    printf("NULL");
    printf("\n");  
}  
      
int main()  
{  
    createNode(40);  
    createNode(30);  
    createNode(10);  
    createNode(20);  

    printf("Original list: \n");  
    display();  
      
    sortList();  
      
    printf("Sorted list: \n");  
    display();  
          
    return 0;  
}