sorting_linked_list.c

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

struct node
{
    int data;
    struct node *nextptr;
}*new;

int main(void)
{
    int n,an,sum;
    printf("Enter the no of nodes you want ");
    scanf("%i",&n);
    createnode(n);

    printf("Printing the unsorted nodes \n ");
    displayList();

    printf("Enter the no of nodes you want to add");
    scanf("%i",&an);
    sum = addnode(an,n);
    printf("The sum of those nodes is %i ",sum);
}
int createnode(int n)
{
    struct node *tmp,*fnnode;
    int num,i;

    new = (struct node *)malloc(sizeof(struct node));
    printf("Input the data for 1 st node : ");
    scanf("%i",&num);
    new->data = num;
    new->nextptr = NULL;
    tmp = new;

    for(i=2;i<=n;i++)
    {
        printf("Enter the data for the next node : ");
        scanf("%i",&num);
        fnnode = (struct node *)malloc(sizeof(struct node));
        fnnode->data = num;
        fnnode->nextptr = NULL;

        tmp->nextptr = fnnode;
        tmp = tmp->nextptr;
    }
}
int displayList()
{
    struct node *tmp;
    tmp = new;
    while(tmp!=NULL)
    {
        printf("Data is : %i \n ",tmp->data);
        tmp = tmp->nextptr;
    }
}



/*
int sot(int n)
{
    struct node *tmp2 ,*sotnode;
    int i,j,temp,k;
    tmp2 = new;
    if(tmp2 = NULL)
    {
        return;
    }
    else
    {
       for(i=0;i<n-1;i++,k--)
       {
           for(j = 1; j<k;j++)
           {
               if(tmp2->data > sotnode->data)
               {
                   temp = tmp2->data;
                   tmp2->data = sotnode->data;
                   sotnode->data = temp;
               }
               tmp2 = tmp2->nextptr;
               sotnode = sotnode->nextptr;
           }
       }
    }
}
*/

int addnode(int an,int n)
{
    struct node *tmp,*fsumnode,*tmp2;
    int len = 0,i;
    int sum = 0;
    tmp = new;
    while(len != an)
    {
        tmp = tmp->nextptr;
        len++;
    }
    tmp2 = tmp;
    for(i=an;i<=n;i++)
    {
        sum = tmp2->data + sum;
    }
    return sum;
}