Sorted Insert In Circular Linked List

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

struct Node
{
  int data;
  struct Node *next;
};

void sortedInsert (struct Node **head_ref, struct Node *new_node)
{
  struct Node *present = *head_ref;

  // Case 1 when list is empty
  if (present == NULL)
    {
      new_node->next = new_node;
      *head_ref = new_node;
    }

  // Case 2 when the node insert before the head
  else if (present->data >= new_node->data)
    {
      //when value is smaller than head's value

      while (present->next != *head_ref)
	present = present->next;

      present->next = new_node;
      new_node->next = *head_ref;
      *head_ref = new_node;
    }

  // Case 3 when node insert in after head in somewhere
  else
    {
      //Locate the node before the point of insertion 

      while (present->next != *head_ref
	     && present->next->data < new_node->data)
	present = present->next;

      new_node->next = present->next;
      present->next = new_node;
    }
}

void display (struct Node *head)
{
  // if there are no node in LL
  if (head == NULL)
    return;

  struct Node *temp = head;

  //need to take care of circular structure of LL
  do
    {
      printf ("%d ", temp->data);
      temp = temp->next;

    }
  while (temp != head);
  printf ("\n");
}

int main ()				//main function
{
  int arr[] = { 12, 56, 2, 11, 1, 90 };

  // start with empty linked list 
  struct Node *head = NULL;
  struct Node *temp;

  // Create linked list from the array arr[]. 
  // Created linked list will be 1->2->11->12->56->90 
  for (int i = 0; i < 6; i++)
    {
      temp = (struct Node *) malloc (sizeof (struct Node));
      
      temp->data = arr[i];
      
      sortedInsert (&head, temp);
    }

  printf ("Sorted Linked List is: ");
  display (head);

  return 0;
}