Bubble Sort

In Bubble sort, Each element of the array is compared with its adjacent element. The algorithm processes the list in passes. A list with n elements requires n-1 passes for sorting. Consider an array A of n elements whose elements are to be sorted by using Bubble sort. The algorithm processes like following.

In Pass 1, A[0] is compared with A[1], A[1] is compared with A[2], A[2] is compared with A[3] and so on. At the end of pass 1, the largest element of the list is placed at the highest index of the list.
In Pass 2, A[0] is compared with A[1], A[1] is compared with A[2] and so on. At the end of Pass 2 the second largest element of the list is placed at the second highest index of the list.
In pass n-1, A[0] is compared with A[1], A[1] is compared with A[2] and so on. At the end of this pass. The smallest element of the list is placed at the first index of the list.

Algorithm :

Step 1: Repeat Step 2 For i = 0 to N-1
Step 2: Repeat For J = i + 1 to N - I
Step 3: IF A[J] > A[i]
SWAP A[J] and A[i]
[END OF INNER LOOP]
[END OF OUTER LOOP
Step 4: EXIT

Complexity

Scenario	Complexity
Space	O(1)
Worst case running time	O(n²)
Average case running time	O(n)
Best case running time	O(n²)

C Program

#include<stdio.h>
void main ()
{
	int i, j,temp; 
	int a[10] = { 10, 9, 7, 101, 23, 44, 12, 78, 34, 23}; 
	for(i = 0; i<10; i++)
	{
		for(j = i+1; j<10; j++)
		{
			if(a[j] > a[i])
			{
				temp = a[i];
				a[i] = a[j];
				a[j] = temp; 
			} 
		} 
	} 
	printf("Printing Sorted Element List ...\n");
	for(i = 0; i<10; i++)
	{
		printf("%d\n",a[i]);
	}
}

Output:

Printing Sorted Element List . . . 
7
9
10
12
23
34
34
44
78 
101

C++ Program

#include<iostream>
using namespace std;
int main ()
{
	int i, j,temp; 
	int a[10] = { 10, 9, 7, 101, 23, 44, 12, 78, 34, 23}; 
	for(i = 0; i<10; i++)
	{
		for(j = i+1; j<10; j++)
		{
			if(a[j] < a[i])
			{
				temp = a[i];
				a[i] = a[j];
				a[j] = temp; 
			} 
		} 
	} 
	cout <<"Printing Sorted Element List ...\n";
	for(i = 0; i<10; i++)
	{
		cout <<a[i]<<"\n";
	}
	return 0;
}

Output:

Printing Sorted Element List ...
7
9
10
12
23
23
34
44
78
101

Java Program

public class BubbleSort {
	public static void main(String[] args) {
	int[] a = {10, 9, 7, 101, 23, 44, 12, 78, 34, 23};
	for(int i=0;i<10;i++)
	{
		for (int j=0;j<10;j++)
		{
			if(a[i]<a[j])
			{
				int temp = a[i];
				a[i]=a[j];
				a[j] = temp; 
			}
		}
	}
	System.out.println("Printing Sorted List ...");
	for(int i=0;i<10;i++)
	{
		System.out.println(a[i]);
	}
}
}

Output:

Printing Sorted List . . . 
7
9
10
12
23
34
34
44
78 
101

C# Program

using System;
					
public class Program
{
	public static void Main()
	{
		int i, j,temp; 
	int[] a = {10, 9, 7, 101, 23, 44, 12, 78, 34, 23}; 
	for(i = 0; i<10; i++)
	{
		for(j = i+1; j<10; j++)
		{
			if(a[j] > a[i])
			{
				temp = a[i];
				a[i] = a[j];
				a[j] = temp; 
			} 
		} 
	} 
	Console.WriteLine("Printing Sorted Element List ...\n");
	for(i = 0; i<10; i++)
	{
		Console.WriteLine(a[i]);
	}
	}
}

Output:

Printing Sorted Element List . . . 
7
9
10
12
23
34
34
44
78 
101

Python Program

a=[10, 9, 7, 101, 23, 44, 12, 78, 34, 23]
for i in range(0,len(a)):
    for j in range(i+1,len(a)):
        if a[j]<a[i]:
            temp = a[j]
            a[j]=a[i]
            a[i]=temp
print("Printing Sorted Element List...")
for i in a: 
    print(i)

Output:

Printing Sorted Element List . . . 
7
9
10
12
23
34
34
44
78 
101

Rust Program

fn main()
{
    let mut temp;
 let mut a: [i32; 10] = [10, 9, 7, 101, 23, 44, 12, 78, 34, 23];
	for i in 0..10
	{
		for j in (i+1)..10
		{
			if a[j] < a[i]
			{
				temp = a[i];
				a[i] = a[j];
				a[j] = temp; 
			}
		} 
	} 
	println!("Printing Sorted Element List ...\n");
	for i in &a
	{
		println!("{} ",i);
	}
}

Output:

Printing Sorted Element List . . . 
7
9
10
12
23
34
34
44
78 
101
4

JavaScript Program

<html>
<head>
<title> 
Bubble Sort 
</title> 
</head> 
<body>
<script> 
	var a = [10, 9, 7, 101, 23, 44, 12, 78, 34, 23];
	for(i=0;i<10;i++)
	{
		for (j=0;j<10;j++)
		{
			if(a[i]<a[j])
			{
				 temp = a[i];
				a[i]=a[j];
				a[j] = temp; 
			}
		}
	}
	txt = "<br>";
	document.writeln("Printing Sorted Element List ..."+txt);
	for(i=0;i<10;i++)
	{
		document.writeln(a[i]);
		document.writeln(txt);
	}
	</script> 
	</body>
</html>

Output:

Printing Sorted Element List ...
7
9
10
12
23
23
34
44
78
101

PHP Program

<html>
<head>
<title>Bubble Sort</title>
</head>
<body>
<?php
	$a = array(10, 9, 7, 101, 23, 44, 12, 78, 34, 23);
	for($i=0;$i<10;$i++)
	{
		for ($j=0;$j<10;$j++)
		{
			if($a[$i]<$a[$j])
			{
				 $temp = $a[$i];
				$a[$i]=$a[$j];
				$a[$j] = $temp; 
			}
		}
	}
	echo "Printing Sorted Element List ...\n";
	for($i=0;$i<10;$i++)
	{
		echo $a[$i];
		echo "\n";
	}
?>
</body>
</html>

Output:

Printing Sorted Element List ...
7
9
10
12
23
23
34
44
78
101

Next TopicBucket Sort

← prev next →

Help Others, Please Share

Learn Latest Tutorials

Arduino

Digital E.

Adwords

MySQL

Python

Smartsheet

Affiliate M.

Testing

Proc*C

SMM

GDB

Fuzzy Logic

Preparation

Aptitude

Reasoning

Verbal A.

Interview

Company

Trending Technologies

AWS

Selenium

Cloud

Hadoop

ReactJS

D. Science

Angular 7

Blockchain

Git

DevOps

B.Tech / MCA

DBMS

DAA

C. Network

Compiler D.

COA

D. Math.

E. Hacking

C. Graphics

Software E.

Web Tech.

Cyber Sec.

Automata

C++

Java

.Net

Python

Programs

Control S.

Data Mining

Javatpoint Services

JavaTpoint offers too many high quality services. Mail us on hr@javatpoint.com, to get more information about given services.

Website Designing
Website Development
Java Development
PHP Development
WordPress
Graphic Designing
Logo
Digital Marketing
On Page and Off Page SEO
PPC
Content Development
Corporate Training
Classroom and Online Training
Data Entry

Training For College Campus

JavaTpoint offers college campus training on Core Java, Advance Java, .Net, Android, Hadoop, PHP, Web Technology and Python. Please mail your requirement at hr@javatpoint.com.
Duration: 1 week to 2 week

^{Like/Subscribe us for latest updates or newsletter}