Bubble Sort On Doubly Linked List
Last Updated :
12 Sep, 2024
Given a doubly linked list, the task is to sort the linked list in non-decreasing order by using bubble sort.
Examples:
Input : head: 5<->3<->4<->1<->2
Output : head: 1<->2<->3<->4<->5
Input : head: 5<->4<->3<->2
Output : head: 2<->3<->4<->5
[Expected Approach - 1] Swapping node Values - O(n^2) Time and O(1) Space:
The bubble sort algorithm for a doubly linked list works by repeatedly traversing the list and comparing adjacent nodes. If two adjacent nodes do not follow the sorted order, their data is swapped. After each complete pass through the list, the largest unsorted element is moved to the end of the list. With each successive pass, the number of nodes that need to be checked decreases as the largest elements is positioned to its correct place. This process continues until the entire list is sorted.
Below is the implementation of the above approach:
C++
// C++ program to sort a doubly linked list
// using bubble sort
#include <iostream>
using namespace std;
class Node {
public:
int data;
Node* next;
Node* prev;
Node(int x) {
data = x;
next = nullptr;
prev = nullptr;
}
};
// Function to sort the doubly linked list
// using bubble sort
Node* bubbleSort(Node* head) {
if (head == nullptr) return head;
bool swapped;
Node* curr;
Node* last = nullptr;
// Keep going until no swaps occur in a pass
do {
swapped = false;
curr = head;
// Traverse through the list and swap adjacent
// nodes if they are in the wrong order
while (curr->next != last) {
if (curr->data > curr->next->data) {
// Swap the data of the current node
// and next node
int swap_data = curr->data;
curr->data = curr->next->data;
curr->next->data = swap_data;
swapped = true;
}
curr = curr->next;
}
// Reduce the effective list size after
// each pass
last = curr;
} while (swapped);
return head;
}
void printList(Node* node) {
Node* curr = node;
while (curr != nullptr) {
cout << " " << curr->data;
curr = curr->next;
}
}
int main() {
// Create a hard-coded doubly linked list:
// 5 <-> 3 <-> 4 <-> 1 <-> 2
Node* head = new Node(5);
head->next = new Node(3);
head->next->prev = head;
head->next->next = new Node(4);
head->next->next->prev = head->next;
head->next->next->next = new Node(1);
head->next->next->next->prev = head->next->next;
head->next->next->next->next = new Node(2);
head->next->next->next->next->prev
= head->next->next->next;
head = bubbleSort(head);
printList(head);
return 0;
}
// C program to sort a doubly linked list
// using bubble sort
#include <stdio.h>
#include <stdlib.h>
struct Node {
int data;
struct Node* next;
struct Node* prev;
};
// Function to sort the doubly linked list using
// bubble sort
struct Node* bubbleSort(struct Node* head) {
if (head == NULL) return head;
int swapped;
struct Node* curr;
struct Node* last = NULL;
// Keep going until no swaps occur in a pass
do {
swapped = 0;
curr = head;
// Traverse through the list and swap adjacent
// nodes if they are in the wrong order
while (curr->next != last) {
if (curr->data > curr->next->data) {
// Swap the data of the current node
// and next node
int swap_data = curr->data;
curr->data = curr->next->data;
curr->next->data = swap_data;
swapped = 1;
}
curr = curr->next;
}
last = curr;
} while (swapped);
return head;
}
void printList(struct Node* node) {
struct Node* curr = node;
while (curr != NULL) {
printf("%d ", curr->data);
curr = curr->next;
}
}
struct Node* createNode(int new_data) {
struct Node* new_node =
(struct Node*)malloc(sizeof(struct Node));
new_node->data = new_data;
new_node->next = NULL;
new_node->prev = NULL;
return new_node;
}
int main() {
// Create a hard-coded doubly linked list:
// 5 <-> 3 <-> 4 <-> 1 <-> 2
struct Node* head = createNode(5);
head->next = createNode(3);
head->next->prev = head;
head->next->next = createNode(4);
head->next->next->prev = head->next;
head->next->next->next = createNode(1);
head->next->next->next->prev
= head->next->next;
head->next->next->next->next = createNode(2);
head->next->next->next->next->prev
= head->next->next->next;
head = bubbleSort(head);
printList(head);
return 0;
}
// Java program to sort a doubly linked list
// using bubble sort
class Node {
int data;
Node next, prev;
Node(int x) {
data = x;
next = null;
prev = null;
}
}
public class GfG {
// Function to sort the linked list using bubble sort
static Node bubbleSort(Node head) {
if (head == null) return head;
boolean swapped;
Node curr;
Node last = null;
// Keep going until no swaps occur in a pass
do {
swapped = false;
curr = head;
// Traverse through the list and swap adjacent
// nodes if they are in the wrong order
while (curr.next != last) {
if (curr.data > curr.next.data) {
// Swap the data of the current node
// and next node
int swap_data = curr.data;
curr.data = curr.next.data;
curr.next.data = swap_data;
swapped = true;
}
curr = curr.next;
}
// Reduce the effective list size
// after each pass
last = curr;
} while (swapped);
return head;
}
static void printList(Node node) {
Node curr = node;
while (curr != null) {
System.out.print(" " + curr.data);
curr = curr.next;
}
}
public static void main(String[] args) {
// Create a hard-coded doubly linked list:
// 5 <-> 3 <-> 4 <-> 1 <-> 2
Node head = new Node(5);
head.next = new Node(3);
head.next.prev = head;
head.next.next = new Node(4);
head.next.next.prev = head.next;
head.next.next.next = new Node(1);
head.next.next.next.prev = head.next.next;
head.next.next.next.next = new Node(2);
head.next.next.next.next.prev
= head.next.next.next;
head = bubbleSort(head);
printList(head);
}
}
# Python program to sort a doubly linked list using
# bubble sort
class Node:
def __init__(self, data):
self.data = data
self.next = None
self.prev = None
# Function to sort the linked list using bubble sort
def bubble_sort(head):
if not head:
return head
swapped = True
last = None
# Keep going until no swaps occur in a pass
while swapped:
swapped = False
curr = head
# Traverse through the list and swap adjacent
# nodes if they are in the wrong order
while curr.next != last:
if curr.data > curr.next.data:
# Swap the data of the current node
# and next node
curr.data, curr.next.data = (
curr.next.data, curr.data
)
swapped = True
curr = curr.next
# Reduce the effective list size after each pass
last = curr
return head
def print_list(node):
curr = node
while curr:
print(curr.data, end=" ")
curr = curr.next
if __name__ == '__main__':
# Create a hard-coded doubly linked list:
# 5 <-> 3 <-> 4 <-> 1 <-> 2
head = Node(5)
head.next = Node(3)
head.next.prev = head
head.next.next = Node(4)
head.next.next.prev = head.next
head.next.next.next = Node(1)
head.next.next.next.prev = head.next.next
head.next.next.next.next = Node(2)
head.next.next.next.next.prev = head.next.next.next
head = bubble_sort(head)
print_list(head)
// C# program to sort a doubly linked list using
// bubble sort
using System;
public class Node {
public int data;
public Node next;
public Node(int new_data) {
data = new_data;
next = null;
}
}
class GfG {
// Function to sort the linked list using bubble sort
static Node BubbleSort(Node head) {
if (head == null) return head;
bool swapped;
Node curr;
Node last = null;
// Keep going until no swaps occur in a pass
do {
swapped = false;
curr = head;
// Traverse through the list and swap adjacent
// nodes if they are in the wrong order
while (curr.next != last) {
if (curr.data > curr.next.data) {
// Swap the data of the current node
// and next node
int swap_data = curr.data;
curr.data = curr.next.data;
curr.next.data = swap_data;
swapped = true;
}
curr = curr.next;
}
// Reduce the effective list size
// after each pass
last = curr;
} while (swapped);
return head;
}
static void PrintList(Node node) {
Node curr = node;
while (curr != null) {
Console.Write(" " + curr.data);
curr = curr.next;
}
}
static void Main(string[] args) {
// Create a hard-coded linked list:
// 5 -> 3 -> 4 -> 1 -> 2
Node head = new Node(5);
head.next = new Node(3);
head.next.next = new Node(4);
head.next.next.next = new Node(1);
head.next.next.next.next = new Node(2);
head = BubbleSort(head);
PrintList(head);
}
}
// JavaScript program to sort a doubly linked list
// using bubble sort
class Node {
constructor(data) {
this.data = data;
this.next = null;
this.prev = null;
}
}
// Function to sort the doubly linked list
// using bubble sort
function bubbleSort(head) {
if (!head) return head;
let swapped;
let last = null;
// Keep going until no swaps occur in a pass
do {
swapped = false;
let curr = head;
// Traverse through the list and swap adjacent
// nodes if they are in the wrong order
while (curr.next !== last) {
if (curr.data > curr.next.data) {
// Swap the data of the current node
// and next node
let swap_data = curr.data;
curr.data = curr.next.data;
curr.next.data = swap_data;
swapped = true;
}
curr = curr.next;
}
// Reduce the effective list size
// after each pass
last = curr;
} while (swapped);
return head;
}
function printList(node) {
let curr = node;
while (curr !== null) {
process.stdout.write(" " + curr.data);
curr = curr.next;
}
}
// Create a hard-coded doubly
// linked list: 5 <-> 3 <-> 4 <-> 1 <-> 2
let head = new Node(5);
head.next = new Node(3);
head.next.prev = head;
head.next.next = new Node(4);
head.next.next.prev = head.next;
head.next.next.next = new Node(1);
head.next.next.next.prev = head.next.next;
head.next.next.next.next = new Node(2);
head.next.next.next.next.prev = head.next.next.next;
head = bubbleSort(head);
printList(head);
Time Complexity: O(n^2), as we are using nested loops for sorting, where n is the number of nodes in the linked list.
Auxiliary Space: O(1)
[Expected Approach - 2] Changing node Links - O(n^2) Time and O(1) Space:
The idea is to sort the doubly linked list by rearranging its nodes rather than swapping their values. We start by traversing the list from the head. For each pass through the list, we compare adjacent nodes and rearrange their links if the nodes are not in sorted order. Instead of swapping the node values, we adjust the next and previous pointers of the nodes to change their positions. This process continues until the entire list is sorted.
Below is the implementation of the above approach:
C++
// C++ program to sort a doubly linked list using
// bubble sort by interchanging links
#include <iostream>
using namespace std;
class Node {
public:
int data;
Node* next;
Node* prev;
Node(int x) {
data = x;
next = nullptr;
prev = nullptr;
}
};
// Function to sort the linked list using bubble sort
Node* bubbleSort(Node* head) {
if (head == nullptr) return head;
bool swapped;
Node* curr;
Node* last = nullptr;
// Keep going until no swaps occur in a pass
do {
swapped = false;
curr = head;
// Traverse through the list and swap adjacent
// nodes if they are in the wrong order
while (curr->next != last) {
if (curr->data > curr->next->data) {
// Swap the nodes by rearranging the links
Node* nextNode = curr->next;
curr->next = nextNode->next;
nextNode->prev = curr->prev;
if (curr->next != nullptr) {
curr->next->prev = curr;
}
if (nextNode->prev != nullptr) {
nextNode->prev->next = nextNode;
} else {
head = nextNode;
}
nextNode->next = curr;
curr->prev = nextNode;
swapped = true;
} else {
curr = curr->next;
}
}
// Reduce the effective list size
// after each pass
last = curr;
} while (swapped);
return head;
}
void printList(Node* node) {
Node* curr = node;
while (curr != nullptr) {
cout << " " << curr->data;
curr = curr->next;
}
}
int main() {
// Create a hard-coded linked list:
// 5 <-> 3 <-> 4 <-> 1 <-> 2
Node* head = new Node(5);
head->next = new Node(3);
head->next->prev = head;
head->next->next = new Node(4);
head->next->next->prev = head->next;
head->next->next->next = new Node(1);
head->next->next->next->prev = head->next->next;
head->next->next->next->next = new Node(2);
head->next->next->next->next->prev
= head->next->next->next;
head = bubbleSort(head);
printList(head);
return 0;
}
// C program to sort a doubly linked list
// using bubble sort by interchanging links
#include <stdio.h>
#include <stdlib.h>
struct Node {
int data;
struct Node* next;
struct Node* prev;
};
// Function to sort the linked list using bubble sort
struct Node* bubbleSort(struct Node* head) {
if (head == NULL) return head;
int swapped;
struct Node* last = NULL;
// Keep going until no swaps occur in a pass
do {
swapped = 0;
struct Node* curr = head;
// Traverse through the list and swap adjacent
// nodes if they are in the wrong order
while (curr->next != last) {
if (curr->data > curr->next->data) {
// Nodes to be swapped
struct Node* nextNode = curr->next;
// Perform the swap
if (curr->prev == NULL) {
// Swapping the head node with next node
head = nextNode;
}
else {
// Linking previous node to next node
curr->prev->next = nextNode;
}
if (nextNode->next != NULL) {
nextNode->next->prev = curr;
}
// Re-linking nodes to complete swap
curr->next = nextNode->next;
nextNode->prev = curr->prev;
nextNode->next = curr;
curr->prev = nextNode;
// Update swapped
swapped = 1;
}
else {
// Move to the next pair of nodes
curr = curr->next;
}
}
// Update the last sorted element
last = curr;
} while (swapped);
return head;
}
void printList(struct Node* node) {
struct Node* curr = node;
while (curr != NULL) {
printf(" %d", curr->data);
curr = curr->next;
}
printf("\n");
}
struct Node* createNode(int new_data) {
struct Node* new_node
= (struct Node*) malloc(sizeof(struct Node));
new_node->data = new_data;
new_node->next = NULL;
new_node->prev = NULL;
return new_node;
}
int main() {
// Create a hard-coded linked list:
// 5 <-> 3 <-> 4 <-> 1 <-> 2
struct Node* head = createNode(5);
head->next = createNode(3);
head->next->prev = head;
head->next->next = createNode(4);
head->next->next->prev = head->next;
head->next->next->next = createNode(1);
head->next->next->next->prev = head->next->next;
head->next->next->next->next = createNode(2);
head->next->next->next->next->prev
= head->next->next->next;
head = bubbleSort(head);
printList(head);
return 0;
}
// Java program to sort a doubly linked list using
// bubble sort by interchanging links
class Node {
int data;
Node next;
Node prev;
Node(int data) {
this.data = data;
this.next = null;
this.prev = null;
}
}
public class GfG {
// Function to sort the linked list using bubble sort
static Node bubbleSort(Node head) {
if (head == null) return head;
boolean swapped;
Node last = null;
// Keep going until no swaps occur in a pass
do {
swapped = false;
Node curr = head;
// Traverse through the list and swap adjacent
// nodes if they are in the wrong order
while (curr.next != last) {
if (curr.data > curr.next.data) {
// Nodes to be swapped
Node nextNode = curr.next;
// Perform the swap
if (curr.prev == null) {
// Swapping the head node
// with next node
head = nextNode;
}
else {
// Linking previous
// node to next node
curr.prev.next = nextNode;
}
if (nextNode.next != null) {
nextNode.next.prev = curr;
}
// Re-linking nodes to complete swap
curr.next = nextNode.next;
nextNode.prev = curr.prev;
nextNode.next = curr;
curr.prev = nextNode;
// Update swapped
swapped = true;
}
else {
// Move to the next pair of nodes
curr = curr.next;
}
}
// Update the last sorted element
last = curr;
} while (swapped);
return head;
}
static void printList(Node node) {
Node curr = node;
while (curr != null) {
System.out.print(" " + curr.data);
curr = curr.next;
}
System.out.println();
}
public static void main(String[] args) {
// Create a hard-coded linked list:
// 5 <-> 3 <-> 4 <-> 1 <-> 2
Node head = new Node(5);
head.next = new Node(3);
head.next.prev = head;
head.next.next = new Node(4);
head.next.next.prev = head.next;
head.next.next.next = new Node(1);
head.next.next.next.prev = head.next.next;
head.next.next.next.next = new Node(2);
head.next.next.next.next.prev
= head.next.next.next;
head = bubbleSort(head);
printList(head);
}
}
# Python program to sort a doubly linked list using
# bubble sort by interchanging links
class Node:
def __init__(self, data):
self.data = data
self.next = None
self.prev = None
def bubble_sort(head):
if head is None:
return head
swapped = True
last = None
# Keep going until no swaps occur in a pass
while swapped:
swapped = False
curr = head
# Traverse through the list and swap adjacent
# nodes if they are in the wrong order
while curr.next != last:
if curr.data > curr.next.data:
# Nodes to be swapped
next_node = curr.next
# Perform the swap
if curr.prev is None:
# Swapping the head node with
# next node
head = next_node
else:
# Linking previous node to next node
curr.prev.next = next_node
if next_node.next is not None:
next_node.next.prev = curr
# Re-linking nodes to complete swap
curr.next = next_node.next
next_node.prev = curr.prev
next_node.next = curr
curr.prev = next_node
# Update swapped
swapped = True
else:
# Move to the next pair of nodes
curr = curr.next
# Update the last sorted element
last = curr
return head
def print_list(node):
curr = node
while curr:
print(curr.data, end=" ")
curr = curr.next
print()
if __name__ == "__main__":
# Create a hard-coded linked list:
# 5 <-> 3 <-> 4 <-> 1 <-> 2
head = Node(5)
head.next = Node(3)
head.next.prev = head
head.next.next = Node(4)
head.next.next.prev = head.next
head.next.next.next = Node(1)
head.next.next.next.prev = head.next.next
head.next.next.next.next = Node(2)
head.next.next.next.next.prev = head.next.next.next
head = bubble_sort(head)
print_list(head)
// C# program to sort a doubly linked list using
// bubble sort by interchanging links
using System;
class Node {
public int Data;
public Node next;
public Node prev;
public Node(int data) {
Data = data;
next = null;
prev = null;
}
}
class GfG {
// Function to sort the linked list using
// bubble sort
static Node BubbleSort(Node head) {
if (head == null) return head;
bool swapped;
Node last = null;
// Keep going until no swaps occur in a pass
do {
swapped = false;
Node curr = head;
// Traverse through the list and swap
// adjacent nodes if they are in
// the wrong order
while (curr.next != last) {
if (curr.Data > curr.next.Data) {
// Nodes to be swapped
Node nextNode = curr.next;
// Perform the swap
if (curr.prev == null) {
// Swapping the head node
// with next node
head = nextNode;
}
else {
// Linking previous node
// to next node
curr.prev.next = nextNode;
}
if (nextNode.next != null) {
nextNode.next.prev = curr;
}
// Re-linking nodes to complete swap
curr.next = nextNode.next;
nextNode.prev = curr.prev;
nextNode.next = curr;
curr.prev = nextNode;
// Update swapped
swapped = true;
}
else {
// Move to the next pair of nodes
curr = curr.next;
}
}
// Update the last sorted element
last = curr;
} while (swapped);
return head;
}
static void PrintList(Node node) {
Node curr = node;
while (curr != null) {
Console.Write(curr.Data + " ");
curr = curr.next;
}
Console.WriteLine();
}
static void Main(string[] args) {
// Create a hard-coded linked list:
// 5 <-> 3 <-> 4 <-> 1 <-> 2
Node head = new Node(5);
head.next = new Node(3);
head.next.prev = head;
head.next.next = new Node(4);
head.next.next.prev = head.next;
head.next.next.next = new Node(1);
head.next.next.next.prev = head.next.next;
head.next.next.next.next = new Node(2);
head.next.next.next.next.prev
= head.next.next.next;
head = BubbleSort(head);
PrintList(head);
}
}
// Javascript program to sort a doubly linked list
// using bubble sort by interchanging links
class Node {
constructor(data) {
this.data = data;
this.next = null;
this.prev = null;
}
}
function bubbleSort(head) {
if (head === null) return head;
let swapped;
let last = null;
// Keep going until no swaps occur in a pass
do {
swapped = false;
let curr = head;
// Traverse through the list and swap adjacent
// nodes if they are in the wrong order
while (curr.next !== last) {
if (curr.data > curr.next.data) {
// Nodes to be swapped
let nextNode = curr.next;
// Perform the swap
if (curr.prev === null) {
// Swapping the head node with next node
head = nextNode;
}
else {
// Linking previous node to next node
curr.prev.next = nextNode;
}
if (nextNode.next !== null) {
nextNode.next.prev = curr;
}
// Re-linking nodes to complete swap
curr.next = nextNode.next;
nextNode.prev = curr.prev;
nextNode.next = curr;
curr.prev = nextNode;
// Update swapped
swapped = true;
}
else {
// Move to the next pair of nodes
curr = curr.next;
}
}
// Update the last sorted element
last = curr;
} while (swapped);
return head;
}
function printList(node) {
let curr = node;
while (curr !== null) {
console.log(curr.data + " ");
curr = curr.next;
}
console.log();
}
// Create a hard-coded linked list:
// 5 <-> 3 <-> 4 <-> 1 <-> 2
let head = new Node(5);
head.next = new Node(3);
head.next.prev = head;
head.next.next = new Node(4);
head.next.next.prev = head.next;
head.next.next.next = new Node(1);
head.next.next.next.prev = head.next.next;
head.next.next.next.next = new Node(2);
head.next.next.next.next.prev = head.next.next.next;
head = bubbleSort(head);
printList(head);
Time Complexity: O(n^2), as we are using nested loops for sorting, where n is the number of nodes in the linked list.
Auxiliary Space: O(1)
Similar Reads
Bubble Sort Algorithm Bubble Sort is the simplest sorting algorithm that works by repeatedly swapping the adjacent elements if they are in the wrong order. This algorithm is not suitable for large data sets as its average and worst-case time complexity are quite high.We sort the array using multiple passes. After the fir
8 min read
Recursive Bubble Sort Background : Bubble Sort is the simplest sorting algorithm that works by repeatedly swapping the adjacent elements if they are in wrong order.Example: First Pass: ( 5 1 4 2 8 ) --> ( 1 5 4 2 8 ), Here, algorithm compares the first two elements, and swaps since 5 > 1. ( 1 5 4 2 8 ) --> ( 1 4
10 min read
Time and Space Complexity Analysis of Bubble Sort The time complexity of Bubble Sort is O(n^2) in the worst-case scenario and the space complexity of Bubble sort is O(1). Bubble Sort only needs a constant amount of additional space during the sorting process. Complexity TypeComplexityTime ComplexityBest: O(n)Average: O(n^2)Worst: O(n^2)Space Comple
3 min read
Bubble Sort in different languages
Visualization of Bubble Sort
Bubble Sort for Linked List by Swapping nodes Given a singly linked list, sort it using bubble sort by swapping nodes. Examples:Input: 5 -> 1 -> 32 -> 10 -> 78Output: 1 -> 5 -> 10 -> 32 -> 78 Input: 20 -> 4 -> 3Output: 3 -> 4 -> 20Approach: To apply Bubble Sort to a linked list, we need to traverse the list m
10 min read
Sorting Strings using Bubble Sort Given an array of strings arr[]. Sort given strings using Bubble Sort and display the sorted array. In Bubble Sort, the two successive strings arr[i] and arr[i+1] are exchanged whenever arr[i]> arr[i+1]. The larger values sink to the bottom and are hence called sinking sort. At the end of each pa
4 min read
Sort an array using Bubble Sort without using loops Given an array arr[] consisting of N integers, the task is to sort the given array by using Bubble Sort without using loops. Examples: Input: arr[] = {1, 3, 4, 2, 5}Output: 1 2 3 4 5 Input: arr[] = {1, 3, 4, 2}Output: 1 2 3 4 Approach: The idea to implement Bubble Sort without using loops is based o
9 min read
Bubble Sort On Doubly Linked List Given a doubly linked list, the task is to sort the linked list in non-decreasing order by using bubble sort.Examples: Input : head: 5<->3<->4<->1<->2Output : head: 1<->2<->3<->4<->5Input : head: 5<->4<->3<->2Output : head: 2<->
15+ min read
Bubble sort using two Stacks Prerequisite : Bubble Sort Write a function that sort an array of integers using stacks and also uses bubble sort paradigm. Algorithm: 1. Push all elements of array in 1st stack 2. Run a loop for 'n' times(n is size of array) having the following : 2.a. Keep on pushing elements in the 2nd stack till
6 min read