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 5 2 8 ), Swap since 5 > 4
( 1 4 5 2 8 ) --> ( 1 4 2 5 8 ), Swap since 5 > 2
( 1 4 2 5 8 ) --> ( 1 4 2 5 8 ), Now, since these elements are already in order (8 > 5), algorithm does not swap them.
Second Pass:
( 1 4 2 5 8 ) --> ( 1 4 2 5 8 )
( 1 4 2 5 8 ) --> ( 1 2 4 5 8 ), Swap since 4 > 2
( 1 2 4 5 8 ) --> ( 1 2 4 5 8 )
( 1 2 4 5 8 ) --> ( 1 2 4 5 8 )
Now, the array is already sorted, but our algorithm does not know if it is completed. The algorithm needs one whole pass without any swap to know it is sorted.
Third Pass:
( 1 2 4 5 8 ) --> ( 1 2 4 5 8 )
( 1 2 4 5 8 ) --> ( 1 2 4 5 8 )
( 1 2 4 5 8 ) --> ( 1 2 4 5 8 )
( 1 2 4 5 8 ) --> ( 1 2 4 5 8 )
Following is iterative Bubble sort algorithm :
// Iterative Bubble Sort
bubbleSort(arr[], n)
{
for (i = 0; i < n-1; i++)
// Last i elements are already in place
for (j = 0; j < n-i-1; j++)
{
if(arr[j] > arr[j+1])
swap(arr[j], arr[j+1]);
}
}
See Bubble Sort for more details.
How to implement it recursively?
Recursive Bubble Sort has no performance/implementation advantages, but can be a good question to check one's understanding of Bubble Sort and recursion.
If we take a closer look at Bubble Sort algorithm, we can notice that in first pass, we move largest element to end (Assuming sorting in increasing order). In second pass, we move second largest element to second last position and so on.
Recursion Idea.
- Base Case: If array size is 1, return.
- Do One Pass of normal Bubble Sort. This pass fixes last element of current subarray.
- Recur for all elements except last of current subarray.
Below is implementation of above idea.
C++
// C++ program for recursive implementation
// of Bubble sort
#include <bits/stdc++.h>
using namespace std;
// A function to implement bubble sort
void bubbleSort(int arr[], int n)
{
// Base case
if (n == 1)
return;
int count = 0;
// One pass of bubble sort. After
// this pass, the largest element
// is moved (or bubbled) to end.
for (int i=0; i<n-1; i++)
if (arr[i] > arr[i+1]){
swap(arr[i], arr[i+1]);
count++;
}
//check if any swapping occur or not
if (count==0)
return;
// Largest element is fixed,
// recur for remaining array
bubbleSort(arr, n-1);
}
/* Function to print an array */
void printArray(int arr[], int n)
{
for (int i=0; i < n; i++)
cout<<arr[i]<<" ";
cout<<"\n";
}
// Driver program to test above functions
int main()
{
int arr[] = {64, 34, 25, 12, 22, 11, 90};
int n = sizeof(arr)/sizeof(arr[0]);
bubbleSort(arr, n);
cout<<"Sorted array : \n";
printArray(arr, n);
return 0;
}
// Code improved by Susobhan Akhuli
// C program for recursive implementation
// of Bubble sort
#include <stdio.h>
// Swap function
void swap(int *xp, int *yp)
{
int temp = *xp;
*xp = *yp;
*yp = temp;
}
// A function to implement bubble sort
void bubbleSort(int arr[], int n)
{
// Base case
if (n == 1)
return;
int count = 0;
// One pass of bubble sort. After
// this pass, the largest element
// is moved (or bubbled) to end.
for (int i=0; i<n-1; i++)
if (arr[i] > arr[i+1]){
swap(&arr[i], &arr[i+1]);
count++;
}
//check if any swapping occur or not
if (count==0)
return;
// Largest element is fixed,
// recur for remaining array
bubbleSort(arr, n-1);
}
/* Function to print an array */
void printArray(int arr[], int n)
{
for (int i=0; i < n; i++)
printf("%d ", arr[i]);
printf("\n");
}
// Driver program to test above functions
int main()
{
int arr[] = {64, 34, 25, 12, 22, 11, 90};
int n = sizeof(arr)/sizeof(arr[0]);
bubbleSort(arr, n);
printf("Sorted array : \n");
printArray(arr, n);
return 0;
}
// This code is submitted by Susobhan Akhuli
// Java program for recursive implementation
// of Bubble sort
import java.util.Arrays;
public class GFG
{
// A function to implement bubble sort
static void bubbleSort(int arr[], int n)
{
// Base case
if (n == 1)
return;
int count = 0;
// One pass of bubble sort. After
// this pass, the largest element
// is moved (or bubbled) to end.
for (int i=0; i<n-1; i++)
if (arr[i] > arr[i+1])
{
// swap arr[i], arr[i+1]
int temp = arr[i];
arr[i] = arr[i+1];
arr[i+1] = temp;
count = count+1;
}
//check if any swapping occur or not
if (count == 0)
return;
// Largest element is fixed,
// recur for remaining array
bubbleSort(arr, n-1);
}
// Driver Method
public static void main(String[] args)
{
int arr[] = {64, 34, 25, 12, 22, 11, 90};
bubbleSort(arr, arr.length);
System.out.println("Sorted array : ");
System.out.println(Arrays.toString(arr));
}
}
// Code improved by Susobhan Akhuli
# Python Program for implementation of
# Recursive Bubble sort
class bubbleSort:
"""
bubbleSort:
function:
bubbleSortRecursive : recursive
function to sort array
__str__ : format print of array
__init__ : constructor
function in python
variables:
self.array = contains array
self.length = length of array
"""
def __init__(self, array):
self.array = array
self.length = len(array)
def __str__(self):
return " ".join([str(x)
for x in self.array])
def bubbleSortRecursive(self, n=None):
if n is None:
n = self.length
count = 0
# Base case
if n == 1:
return
# One pass of bubble sort. After
# this pass, the largest element
# is moved (or bubbled) to end.
for i in range(n - 1):
if self.array[i] > self.array[i + 1]:
self.array[i], self.array[i +
1] = self.array[i + 1], self.array[i]
count = count + 1
#check if any swapping occur or not
if (count==0):
return
# Largest element is fixed,
# recur for remaining array
self.bubbleSortRecursive(n - 1)
# Driver Code
def main():
array = [64, 34, 25, 12, 22, 11, 90]
# Creating object for class
sort = bubbleSort(array)
# Sorting array
sort.bubbleSortRecursive()
print("Sorted array :\n", sort)
if __name__ == "__main__":
main()
# Code contributed by Mohit Gupta_OMG,
# improved by itsvinayak
# Code improved by Susobhan Akhuli
// C# program for recursive
// implementation of Bubble sort
using System;
class GFG
{
// A function to implement
// bubble sort
static void bubbleSort(int []arr,
int n)
{
// Base case
if (n == 1)
return;
int count = 0;
// One pass of bubble
// sort. After this pass,
// the largest element
// is moved (or bubbled)
// to end.
for (int i = 0; i < n - 1; i++)
if (arr[i] > arr[i + 1])
{
// swap arr[i], arr[i+1]
int temp = arr[i];
arr[i] = arr[i + 1];
arr[i + 1] = temp;
count++;
}
//check if any swapping occur or not
if (count==0)
return;
// Largest element is fixed,
// recur for remaining array
bubbleSort(arr, n - 1);
}
// Driver code
static void Main()
{
int []arr = {64, 34, 25,
12, 22, 11, 90};
bubbleSort(arr, arr.Length);
Console.WriteLine("Sorted array : ");
for(int i = 0; i < arr.Length; i++)
Console.Write(arr[i] + " ");
}
}
// This code is contributed
// by Sam007
// Code improved by Susobhan Akhuli
// JavaScript program for recursive implementation of Bubble Sort using console.log
function bubbleSort(arr, n) {
// Base case
if (n == 1)
return;
let count = 0;
// One pass of bubble sort
for (let i = 0; i < n - 1; i++) {
if (arr[i] > arr[i + 1]) {
// Swap arr[i] and arr[i+1]
let temp = arr[i];
arr[i] = arr[i + 1];
arr[i + 1] = temp;
count++;
}
}
// If no elements were swapped, the array is sorted
if (count == 0)
return;
// Recursive call for remaining array
bubbleSort(arr, n - 1);
}
// Driver code
let arr = [64, 34, 25, 12, 22, 11, 90];
bubbleSort(arr, arr.length);
console.log("Sorted array:");
console.log(arr.join(" "));
<?php
// PHP program for recursive implementation of Bubble sort
// A function to implement bubble sort
function bubbleSort(&$arr, $n)
{
// Base case
if ($n == 1)
return;
$count = 0;
// One pass of bubble sort. After
// this pass, the largest element
// is moved (or bubbled) to end.
for ($i=0; $i<$n-1; $i++)
if ($arr[$i] > $arr[$i+1]){
list($arr[$i], $arr[$i+1]) = array($arr[$i+1], $arr[$i]);
$count++;
}
//check if any swapping occur or not
if ($count==0)
return;
// Largest element is fixed,
// recur for remaining array
bubbleSort($arr, $n-1);
}
/* Function to print an array */
function printArray($arr, $n)
{
for ($i=0; $i < $n; $i++)
echo $arr[$i]." ";
echo "\n";
}
// Driver program to test above functions
$arr = array(64, 34, 25, 12, 22, 11, 90);
$n = sizeof($arr);
bubbleSort($arr, $n);
echo "Sorted array : \n";
printArray($arr, $n);
// This code is submitted by Susobhan Akhuli
?>
OutputSorted array :
11 12 22 25 34 64 90
- Time Complexity: O(n*n)
- Auxiliary Space: O(n)
Question:
1. Difference between iterative and recursive bubble sort?
Ans. Recursive bubble sort runs on O(n) auxiliary space complexity whereas iterative bubble sort runs on O(1) auxiliary space complexity.
2. Which is faster iterative or recursive bubble sort?
Ans. Based on the number of comparisons in each method, the recursive bubble sort is better than the iterative bubble sort, but the time complexity for both the methods is same.
3. Which sorting method we should prefer more iterative or recursive bubble sort?
Ans. Both the methods complete the computation at the same time(according to time complexity analysis) but iterative code takes less memory than recursive one, so we should prefer iterative bubble sort more than recursive bubble sort.
Similar Reads
Basics & Prerequisites
Data Structures
Array Data StructureIn this article, we introduce array, implementation in different popular languages, its basic operations and commonly seen problems / interview questions. An array stores items (in case of C/C++ and Java Primitive Arrays) or their references (in case of Python, JS, Java Non-Primitive) at contiguous
3 min read
String in Data StructureA string is a sequence of characters. The following facts make string an interesting data structure.Small set of elements. Unlike normal array, strings typically have smaller set of items. For example, lowercase English alphabet has only 26 characters. ASCII has only 256 characters.Strings are immut
2 min read
Hashing in Data StructureHashing is a technique used in data structures that efficiently stores and retrieves data in a way that allows for quick access. Hashing involves mapping data to a specific index in a hash table (an array of items) using a hash function. It enables fast retrieval of information based on its key. The
2 min read
Linked List Data StructureA linked list is a fundamental data structure in computer science. It mainly allows efficient insertion and deletion operations compared to arrays. Like arrays, it is also used to implement other data structures like stack, queue and deque. Here’s the comparison of Linked List vs Arrays Linked List:
2 min read
Stack Data StructureA Stack is a linear data structure that follows a particular order in which the operations are performed. The order may be LIFO(Last In First Out) or FILO(First In Last Out). LIFO implies that the element that is inserted last, comes out first and FILO implies that the element that is inserted first
2 min read
Queue Data StructureA Queue Data Structure is a fundamental concept in computer science used for storing and managing data in a specific order. It follows the principle of "First in, First out" (FIFO), where the first element added to the queue is the first one to be removed. It is used as a buffer in computer systems
2 min read
Tree Data StructureTree Data Structure is a non-linear data structure in which a collection of elements known as nodes are connected to each other via edges such that there exists exactly one path between any two nodes. Types of TreeBinary Tree : Every node has at most two childrenTernary Tree : Every node has at most
4 min read
Graph Data StructureGraph Data Structure is a collection of nodes connected by edges. It's used to represent relationships between different entities. If you are looking for topic-wise list of problems on different topics like DFS, BFS, Topological Sort, Shortest Path, etc., please refer to Graph Algorithms. Basics of
3 min read
Trie Data StructureThe Trie data structure is a tree-like structure used for storing a dynamic set of strings. It allows for efficient retrieval and storage of keys, making it highly effective in handling large datasets. Trie supports operations such as insertion, search, deletion of keys, and prefix searches. In this
15+ min read
Algorithms
Searching AlgorithmsSearching algorithms are essential tools in computer science used to locate specific items within a collection of data. In this tutorial, we are mainly going to focus upon searching in an array. When we search an item in an array, there are two most common algorithms used based on the type of input
2 min read
Sorting AlgorithmsA Sorting Algorithm is used to rearrange a given array or list of elements in an order. For example, a given array [10, 20, 5, 2] becomes [2, 5, 10, 20] after sorting in increasing order and becomes [20, 10, 5, 2] after sorting in decreasing order. There exist different sorting algorithms for differ
3 min read
Introduction to RecursionThe process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called a recursive function. A recursive algorithm takes one step toward solution and then recursively call itself to further move. The algorithm stops once we reach the solution
14 min read
Greedy AlgorithmsGreedy algorithms are a class of algorithms that make locally optimal choices at each step with the hope of finding a global optimum solution. At every step of the algorithm, we make a choice that looks the best at the moment. To make the choice, we sometimes sort the array so that we can always get
3 min read
Graph AlgorithmsGraph is a non-linear data structure like tree data structure. The limitation of tree is, it can only represent hierarchical data. For situations where nodes or vertices are randomly connected with each other other, we use Graph. Example situations where we use graph data structure are, a social net
3 min read
Dynamic Programming or DPDynamic Programming is an algorithmic technique with the following properties.It is mainly an optimization over plain recursion. Wherever we see a recursive solution that has repeated calls for the same inputs, we can optimize it using Dynamic Programming. The idea is to simply store the results of
3 min read
Bitwise AlgorithmsBitwise algorithms in Data Structures and Algorithms (DSA) involve manipulating individual bits of binary representations of numbers to perform operations efficiently. These algorithms utilize bitwise operators like AND, OR, XOR, NOT, Left Shift, and Right Shift.BasicsIntroduction to Bitwise Algorit
4 min read
Advanced
Segment TreeSegment Tree is a data structure that allows efficient querying and updating of intervals or segments of an array. It is particularly useful for problems involving range queries, such as finding the sum, minimum, maximum, or any other operation over a specific range of elements in an array. The tree
3 min read
Pattern SearchingPattern searching algorithms are essential tools in computer science and data processing. These algorithms are designed to efficiently find a particular pattern within a larger set of data. Patten SearchingImportant Pattern Searching Algorithms:Naive String Matching : A Simple Algorithm that works i
2 min read
GeometryGeometry is a branch of mathematics that studies the properties, measurements, and relationships of points, lines, angles, surfaces, and solids. From basic lines and angles to complex structures, it helps us understand the world around us.Geometry for Students and BeginnersThis section covers key br
2 min read
Interview Preparation
Practice Problem