SCHOOL OF CODE BUILDERS: insert an element in a sorted linked list

insert an element in a sorted linked list

#include <stdio.h>
#include <stdlib.h>
struct node
{
 int data;
 struct node *next;
};

struct node* newnode(int data)
{
 struct node *new=(struct node*)malloc(sizeof(struct node));
 new->data=data;
 new->next=NULL;
 return new;
}

void insertashead(struct node **head,int data)
{
 struct node *temp=newnode(data);
 if((*head)==NULL)
  *head=temp;
 else
 {
  temp->next=(*head);
  (*head)=temp;
 }
}

void printlist(struct node *head)
{
 while(head!=NULL)
 {
  printf("%d ",head->data);
  head=head->next;
 }
}

struct node* sortedinsert(struct node *head,int key)
{
 struct node *temp=newnode(key);
 struct node *current=head;
 if(current==NULL)
  return temp;
 else if(key < current->data)
 {
  temp->next=current;
  current=temp;
  return current;
 }
 else
 {
  while(key > current->next->data)
  {
   current=current->next;
  }
  temp->next=current->next;
  current->next=temp;
  return head;
 }
}

int main(void) {
 struct node *head=NULL;
 int n,x,i,key;
 scanf("%d",&n);
 for(i=0;i<n;i++)
 {
  scanf("%d",&x);
  insertashead(&head,x);
 }
 printlist(head);
 printf("\n");
 scanf("%d",&key);
 head=sortedinsert(head,key);
 printlist(head);
 return 0;
}

Pages

insert an element in a sorted linked list