Bubble sort on linked list in c#

Csharp program for Bubble sort on linked list.
// Include namespace system
using System;
// C# program for
// Bubble Sort For Linked List
public class Node
{
public int data;
public Node next;
public Node(int data)
{
this.data = data;
this.next = null;
}
}
public class LinkedList
{
public Node head;
// Class constructors
public LinkedList()
{
this.head = null;
}
// Add node at the beginning of linked list
public void insert(int value)
{
// Create a new node
var node = new Node(value);
// Add node at front
node.next = this.head;
// Make new head
this.head = node;
}
// Display all elements
public void display()
{
if (this.head != null)
{
var temp = this.head;
while (temp != null)
{
// Display node value
Console.Write(" " + temp.data);
// Visit to next node
temp = temp.next;
}
}
else
{
Console.WriteLine("Empty Linked list");
}
}
// Perform bubble sort in single linked list
public void bubbleSort()
{
if (this.head != null)
{
Node current = null;
var status = false;
do {
// Start with first node
current = this.head;
// Reset working status
status = false;
while (current != null && current.next != null)
{
if (current.data > current.next.data)
{
// Swap node values
current.data = current.data + current.next.data;
current.next.data = current.data - current.next.data;
current.data = current.data - current.next.data;
// When node value change
status = true;
}
// Visit to next node
current = current.next;
}
} while (status);
}
else
{
Console.WriteLine("Empty Linked list");
}
}
public static void Main(String[] args)
{
var task = new LinkedList();
// Insert element of linked list
task.insert(15);
task.insert(5);
task.insert(42);
task.insert(9);
task.insert(50);
task.insert(7);
Console.Write(" Before sort : ");
// Display all node
task.display();
task.bubbleSort();
Console.Write("\n After sort : ");
task.display();
}
}
Output
Before sort : 7 50 9 42 5 15
After sort : 5 7 9 15 42 50
Please share your knowledge to improve code and content standard. Also submit your doubts, and test case. We improve by your feedback. We will try to resolve your query as soon as possible.
New Comment