Program to Sort the Elements of the Circular Linked List

Q. Program to sort the elements of the circular linked list.

Explanation

In this program, we will create a circular linked list and sort the list in ascending order. In this example, we maintain two nodes: current which will point to head and index which will point to next node to current. The first loop, keep track of current and second loop will keep track of index. In the first iteration, current will point to 9. The index will point to node next to current which in this case is 5. 9 is compared with 5, since 9 > 5, swap data of index node with the current node. Now, the current will have 5. Now, 5 will be compared to 2. Again 5 > 2, swap the data. Now current will hold 2 and index will hold 7. 2 < 7, nothing will be done. The index will be incremented and pointed to 3. 2 < 3. Nothing will be done. In this way, we will have a minimum value node in the first position. Then, we will keep on finding minimum element in the rest of the list until the list is completely sorted.

9->5->2->7->3
2->9->5->7->3
2->3->9->7->5
2->3->5->9->7
2->3->5->7->9

Algorithm

Define a Node class which represents a node in the list. It has two properties data and next which will point to the next node.
Define another class for creating a circular linked list, and it has two nodes: head and tail.
sortList() will sort the list:
1. We will maintain two nodes current which points to head, and index will point to node next to current.
2. Traverse through the list starting from index till the end is reached.
3. If current.data is greater than the index.data, swap the data between them.
4. At the first iteration, we will get minimum element at the start of the list.
5. Then current will point to current.next.
6. Repeat steps b to e till we get next minimum node.
7. At the end of both the loop, the list will be sorted.

Solution

Python

  #Represents the node of list.  class Node:      def __init__(self,data):          self.data = data;          self.next = None;    class CreateList:      #Declaring head and tail pointer as null.      def __init__(self):          self.head = Node(None);          self.tail = Node(None);          self.head.next = self.tail;          self.tail.next = self.head;            #This function will add the new node at the end of the list.      def add(self,data):          newNode = Node(data);          #Checks if the list is empty.          if self.head.data is None:              #If list is empty, both head and tail would point to new node.              self.head = newNode;              self.tail = newNode;              newNode.next = self.head;          else:              #tail will point to new node.              self.tail.next = newNode;              #New node will become new tail.              self.tail = newNode;              #Since, it is circular linked list tail will point to head.              self.tail.next = self.head;            #This function sorts the list in ascending order      def sortList(self):          #Current will point to head          current = self.head;          if(self.head == None):              print(“List is empty”);          else:              while(True):                  #Index will point to node next to current                  index = current.next;                  while(index != self.head):                      #If current node is greater than index data, swaps the data                      if(current.data > index.data):                          temp = current.data;                          current.data = index.data;                          index.data = temp;                      index= index.next;                  current =current.next;                  if(current.next == self.head):                      break;                            #Displays all the nodes in the list      def display(self):          current = self.head;          if self.head is None:              print(“List is empty”);              return;          else:              #Prints each node by incrementing pointer.              print(current.data, end= ‘ ‘);              while(current.next != self.head):                  current = current.next;                  print(current.data,end=’ ‘);          print(“n”);                class CircularLinkedList:      cl = CreateList();      #Adds data to the list      cl.add(70);      cl.add(90);      cl.add(20);      cl.add(100);      cl.add(50);            #Displaying original list      print(“Original list: “);      cl.display();            #Sorting list      cl.sortList();            #Displaying sorted list      print(“Sorted list: “);      cl.display();  

Output:

Original list:    70 90 20 100 50  Sorted list:    20 50 70 90 100

C

  #include <stdio.h>  #include <string.h>  #include <stdlib.h>    //Represents the node of the list.    struct node{      int data;      struct node *next;  };    //Declaring head and tail pointer as null.  struct node *head = NULL;  struct node *tail = NULL;    //This function will add the new node at the end of the list.  void add(int data){      //Create new node      struct node *newNode = (struct node*)malloc(sizeof(struct node));      newNode->data = data;      //Checks if the list is empty.      if(head == NULL){          //If list is empty, both head and tail would point to new node.          head = newNode;          tail = newNode;          newNode->next = head;      }else {          //tail will point to new node.  tail->next = newNode;  //New node will become new tail.  tail = newNode;  //Since, it is circular linked list tail will point to head.  tail->next = head;  }  }    //This function sorts the list in ascending order  void sortList() {  //Current will point to head  struct node *current = head, *index = NULL;  int temp;  if(head == NULL) {  printf(“List is empty”);  }  else {  do{  //Index will point to node next to current  index = current->next;  while(index != head) {  //If current node is greater than index data, swaps the data  if(current->data > index->data) {  temp =current->data;  current->data= index->data;  index->data = temp;  }  index= index->next;  }  current =current->next;  }while(current->next != head);   }  }  //This function will display the nodes of circular linked list  void display(){      struct node *current = head;      if(head == NULL){          printf(“List is empty”);      }      else{  do{       //Prints each node by incrementing pointer.  printf(“%d “, current->data);  current = current->next;  }while(current != head);  printf(“n”);      }  }        int main()  {     //Adds data to the list     add(70);     add(90);     add(20);     add(100);     add(50);     //Displaying original list     printf(“Original list: n”);     display();     //Sorting list     sortList();     //Displaying sorted list     printf(“Sorted list: n”);     display();          return 0;  }  

Output:

Original list:    70 90 20 100 50  Sorted list:    20 50 70 90 100

JAVA

  public class SortList {  //Represents the node of list.  public class Node{  int data;  Node next;  public Node(int data) {  this.data = data;  }  }  //Declaring head and tail pointer as null.  public Node head = null;  public Node tail = null;  //This function will add the new node at the end of the list.  public void add(int data){  //Create new node  Node newNode = new Node(data);  //Checks if the list is empty.  if(head == null) {   //If list is empty, both head and tail would point to new node.  head = newNode;  tail = newNode;  newNode.next = head;  }  else {  //tail will point to new node.  tail.next = newNode;  //New node will become new tail.  tail = newNode;  //Since, it is circular linked list tail will points to head.  tail.next = head;  }  }  //This function sorts the list in ascending order  public void sortList() {  //Current will point to head  Node current = head, index = null;  int temp;  if(head == null) {  System.out.println(“List is empty”);  }  else {  do{  //Index will point to node next to current  index = current.next;  while(index != head) {  //If current node is greater than index data, swaps the data  if(current.data > index.data) {  temp =current.data;  current.data= index.data;  index.data = temp;  }  index= index.next;  }  current =current.next;  }while(current.next != head);   }  }  //Displays all the nodes in the list  public void display() {  Node current = head;  if(head == null) {  System.out.println(“List is empty”);  }  else {   do{  //Prints each node by incrementing pointer.  System.out.print(” “+ current.data);  current = current.next;  }while(current != head);  System.out.println();  }  }  public static void main(String[] args) {  SortList cl = new SortList();  //Adds data to the list  cl.add(70);  cl.add(90);  cl.add(20);  cl.add(100);  cl.add(50);  //Displaying original list  System.out.println(“Original list: “);  cl.display();  //Sorting list  cl.sortList();  //Displaying sorted list  System.out.println(“Sorted list: “);  cl.display();  }  }  

Output:

Original list:    70 90 20 100 50  Sorted list:    20 50 70 90 100

C#

  using System;   namespace CircularLinkedList   {    public class Program  {  //Represents the node of list.  public class Node<T>{  public T data;  public Node<T> next;  public Node(T value) {  data = value;  next = null;  }  }  public class CreateList<T>  where T : IComparable<T> {  protected Node<T> head = null;                 protected Node<T> tail = null;  //This function will add the new node at the end of the list.  public void add(T data){  //Create new node  Node<T> newNode = new Node<T>(data);  //Checks if the list is empty.  if(head == null){  head = newNode;  tail = newNode;  newNode.next = head;  }else{  //tail will point to new node.  tail.next = newNode;  //New node will become new tail.  tail = newNode;  //Since, it is circular linked list tail will point to head.  tail.next = head;  }  }  //This function sorts the list in ascending order  public void sortList() {  //Current will point to head  Node<T> current = head, index = null;  T temp;  if(head == null) {  Console.WriteLine(“List is empty”);  }  else {  do{  //Index will point to node next to current  index = current.next;  while(index != head) {  //If current node is greater than index data, swaps the data  if(current.data.CompareTo(index.data) > 0) {  temp = current.data;  current.data= index.data;  index.data = temp;  }  index= index.next;  }  current =current.next;  }while(current.next != head);   }  }  //Displays all the nodes in the list  public void display(){  Node<T> current = head;  if(head == null){  Console.WriteLine(“List is empty”);  }  else{   do{  //Prints each node by incrementing pointer.  Console.Write(” “+ current.data);  current = current.next;  }while(current != head);  Console.WriteLine();  }  }   }  public static void Main()  {  CreateList<int> cl = new CreateList<int>();  //Adds data to the list  cl.add(70);  cl.add(90);  cl.add(20);  cl.add(100);  cl.add(50);  //Displaying original list  Console.WriteLine(“Original list: “);  cl.display();  //Sorting list  cl.sortList();  //Displaying sorted list  Console.WriteLine(“Sorted list: “);  cl.display();  }   }  }  

Output:

Original list:    70 90 20 100 50  Sorted list:    20 50 70 90 100

PHP

  <!DOCTYPE html>  <html>  <body>  <?php  //Represents the node of list.  class Node{      public $data;      public $next;      function __construct($data){          $this->data = $data;          $this->next = NULL;      }  }  class CreateList{      //Declaring head and tail pointer as null.      private $head;      private $tail;      function __construct(){          $this->head = NULL;          $this->tail = NULL;      }      //This function will add the new node at the end of the list.      function add($data){          //Create new node          $newNode = new Node($data);          //Checks if the list is empty.          if($this->head == NULL){              //If list is empty, both head and tail would point to new node.              $this->head = $newNode;              $this->tail = $newNode;              $newNode->next = $this->head;          }          else{              //tail will point to new node.              $this->tail->next = $newNode;              //New node will become new tail.              $this->tail = $newNode;              //Since, it is circular linked list tail will point to head.              $this->tail->next = $this->head;          }      }            //This function sorts the list in ascending order  function sortList() {  //Current will point to head  $current = $this->head;  if($this->head == NULL) {  echo “List is empty”;  }  else {  do{  //Index will point to node next to current  $index = $current->next;  while($index != $this->head) {  //If current node is greater than index data, swaps the data  if($current->data > $index->data) {  $temp = $current->data;  $current->data= $index->data;  $index->data = $temp;  }  $index= $index->next;  }  $current = $current->next;  }while($current->next != $this->head);   }  }            //Displays all the nodes in the list      function display() {          $current = $this->head;          if($this->head == NULL) {              echo “List is empty”;          }          else {               do{                  //Prints each node by incrementing pointer.                  echo(” $current->data”);                  $current = $current->next;              }while($current != $this->head);              echo “<br>”;          }      }     }  $cl = new CreateList();  //Adds data to the list  $cl->add(70);  $cl->add(90);  $cl->add(20);  $cl->add(100);  $cl->add(50);    //Displaying original list  echo “Original list:<br>”;  $cl->display();    //Sorting list  $cl->sortList();    //Displaying sorted list  echo “Sorted list:<br>”;  $cl->display();  ?>  </body>  </html>  

Output:

Original list:    70 90 20 100 50  Sorted list:    20 50 70 90 100

Next Topic#

Q. Program to sort the elements of the circular linked list.

Explanation

Algorithm

Solution

Python

C

JAVA

C#

PHP

program to find the volume of cylinder

Automate LinkedIn Connections using Python

You may also like