Sorted Insert In Circular Linked List

How to insert in a sorted circular linked list in C?

C program to insert in a sorted circular linked list means to insert the data in a circular linked list in a way that its logical order does not get disturbed. To do this first we need to ensure that the list we are working upon is already sorted else we will have to sort the given list before performing the operation.

Let us learn how to write a program for sorted insert in circular linked using the steps and algorithm discussed in this article.

Sorted insert in circular linked list

In this topic we will discuss about the how to insert the node in the sorted circular linked list.

first of all we will do  allocated the memory for newly inserted node and put data in the newly allocated node.Let the pointer to the new node to be new_node.

After memory allocation we have three ways for insert the data is following –

• First one is if linked list is empty then since new_node is only node in circular linked list, make a self loop.and change the  head pointer  to the new_node pointer.
• Second case is new node insert in starting or before the head node.
1. Find out the last node using a loop.
present=present->next;
2. Change the next of last node;
present->next=new-node;
3. Change next of new node to point to head.
4. D- Change the head pointer to point to new node.
• Third case is when we insert the new node after the head in any position,then
1. Locate the node after which new node is to be inserted.
present->next->data data) { present = present->next; }
2. Make next of new_node as next of the located pointer
new_node->next = present->next;
3. Change the next of the located pointer present->next = new_node;
Run
```#include<stdio.h>
#include<stdlib.h>

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

void sortedInsert (struct Node **head_ref, struct Node *new_node)
{

// Case 1 when list is empty
if (present == NULL)
{
new_node->next = 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

present = present->next;

present->next = new_node;
}

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

&& present->next->data < new_node->data)
present = present->next;

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

{
// if there are no node in LL
return;

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

}
printf ("\n");
}

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

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];

}

printf ("Sorted Linked List is: ");

return 0;
}
```

Output

`sorted Linked List is: 1 2 11 12 56 90`

Related Banners

Get PrepInsta Prime & get Access to all 200+ courses offered by PrepInsta in One Subscription

Get over 200+ course One Subscription

Courses like AI/ML, Cloud Computing, Ethical Hacking, C, C++, Java, Python, DSA (All Languages), Competitive Coding (All Languages), TCS, Infosys, Wipro, Amazon, DBMS, SQL and others

Checkout list of all the video courses in PrepInsta Prime Subscription

• Introduction to Circular Linked List
• Circular Linked List in –
C | C++ | Java
• Insertion in Circular Linked List –
C | C++ | Java
• Insertion at the beginning–
C | C++ | Java
• Insertion at the end –
C | C++ | Java
• Insertion at nth position –
C | C++ | Java
• Deletion in Circular Linked List –
C | C++ | Java
• Deletion from beginning in Circular Linked List –
C | C++ | Java
• Deletion from nth position in Circular Linked List –
• Deletion from end in Circular Linked List –
C | C++ | Java
• Insertion and Deletion in Circular Linked List – C | C++ | Java
• Split a Circular Linked List in two halves –
C | C++ | Java
• Count nodes in Circular Linked List –
C | C++ | Java
• Sorted Insert In Circular Linked List –
C | C++ | Java
• Insertion in the middle in Circular Linked List –
C | C++ | Java