Data Structures Tutorial

Data Structures Tutorial Asymptotic Notation Structure and Union Array Data Structure Linked list Data Structure Type of Linked list Advantages and Disadvantages of linked list Queue Data Structure Implementation of Queue Stack Data Structure Implementation of Stack Sorting Insertion sort Quick sort Selection sort Heap sort Merge sort Bucket sort Count sort Radix sort Shell sort Tree Traversal of the binary tree Binary search tree Graph Spanning tree Linear Search Binary Search Hashing Collision Resolution Techniques

Misc Topic:

Priority Queue in Data Structure Deque in Data Structure Difference Between Linear And Non Linear Data Structures Queue Operations In Data Structure About Data Structures Data Structures Algorithms Types of Data Structures Big O Notations Introduction to Arrays Introduction to 1D-Arrays Operations on 1D-Arrays Introduction to 2D-Arrays Operations on 2D-Arrays Strings in Data Structures String Operations Application of 2D array Bubble Sort Insertion Sort Sorting Algorithms What is DFS Algorithm What Is Graph Data Structure What is the difference between Tree and Graph What is the difference between DFS and BFS Bucket Sort Dijkstra’s vs Bellman-Ford Algorithm Linear Queue Data Structure in C Stack Using Array Stack Using Linked List Recursion in Fibonacci Stack vs Array What is Skewed Binary Tree Primitive Data Structure in C Dynamic memory allocation of structure in C Application of Stack in Data Structures Binary Tree in Data Structures Heap Data Structure Recursion - Factorial and Fibonacci What is B tree what is B+ tree Huffman tree in Data Structures Insertion Sort vs Bubble Sort Adding one to the number represented an array of digits Bitwise Operators and their Important Tricks Blowfish algorithm Bubble Sort vs Selection Sort Hashing and its Applications Heap Sort vs Merge Sort Insertion Sort vs Selection Sort Merge Conflicts and ways to handle them Difference between Stack and Queue AVL tree in data structure c++ Bubble sort algorithm using Javascript Buffer overflow attack with examples Find out the area between two concentric circles Lowest common ancestor in a binary search tree Number of visible boxes putting one inside another Program to calculate the area of the circumcircle of an equilateral triangle Red-black Tree in Data Structures Strictly binary tree in Data Structures 2-3 Trees and Basic Operations on them Asynchronous advantage actor-critic (A3C) Algorithm Bubble Sort vs Heap Sort Digital Search Tree in Data Structures Minimum Spanning Tree Permutation Sort or Bogo Sort Quick Sort vs Merge Sort Boruvkas algorithm Bubble Sort vs Quick Sort Common Operations on various Data Structures Detect and Remove Loop in a Linked List How to Start Learning DSA Print kth least significant bit number Why is Binary Heap Preferred over BST for Priority Queue Bin Packing Problem Binary Tree Inorder Traversal Burning binary tree Equal Sum What is a Threaded Binary Tree? What is a full Binary Tree? Bubble Sort vs Merge Sort B+ Tree Program in Q language Deletion Operation from A B Tree Deletion Operation of the binary search tree in C++ language Does Overloading Work with Inheritance Balanced Binary Tree Binary tree deletion Binary tree insertion Cocktail Sort Comb Sort FIFO approach Operations of B Tree in C++ Language Recaman’s Sequence Tim Sort Understanding Data Processing

Bubble sort algorithm using Javascript

Sorting is a very useful technique in many algorithms and programs. Basically, sorting operations help us to arrange a set of data in a particular manner. Bubble sort is one of the basic and easiest sorting approaches. Let's take an example to discuss sorting.

Before sorting:


After sorting:


We have numbers in an array, and we want to arrange them in increasing order. To solve this problem, we have to use sorting.


[30, 40, 20, 10, 60, 70, 80, 50, 100, 90]


[10, 20, 30, 40, 50, 60, 70, 80, 90, 100]

Explanation- We have sorted the given array in increasing order.

Bubble Sort : - Bubble sort is an easy and slow sorting algorithm. This sorting algorithm is a comparison-based algorithm in which each pair of adjacent elements is compared. After that they are swapped if they are not in order.


Step 1: Start

Step 2: All values are taken from the user to build an array.

Step 3: Array is created.

Step 4: A function is called. This function takes the array as input and processes it.

Step 5: We traverse the array n times (n is the size of the array).

Step 6: If we find any element is bigger than its next element, then we swap them.

Step 7: After repeating step 6 in every traversal, we get the sorted array.

Step 8: The returned array will be printed.

Step 9: Stop.


Begin bubblesort( list )
			for all elements of list
				if list[ I ] > list[ i+1 ] 
					swap( list[ I ], list[ i+1 ]  )
				end if
			end for
		end bubblesort

Explanation of Algorithm: -


Let's try to understand the algorithm with this unsorted array. So, the process of sorting starts with the very first two elements. We compare them to check which one is greater.


In this case, 33 is greater than 14, so it is sorted already. Now we go to the next step.


In this case, 33 is greater than 27, so we swap them. In this way, we traverse all the elements of the array. After the first traversal, we get the last element sorted, and after n times traversal, all elements will be sorted.

Step 1:


Step 2:


Step 3:


Step 4:


Code: -

function bubbleSort( arr ){

var i, j;
var len = arr.length;

var isSwapped = false;

for(i =0; i < len; i++){
	isSwapped = false;
	for(j = 0; j < len; j++){
		if(arr[j] > arr[j + 1]){
		var temp = arr[j]
		arr[j] = arr[j+1];
		arr[j+1] = temp;
		isSwapped = true;
	// IF no two elements were swapped by the inner loop, then break

// Print the array

// calling the bubbleSort Function

Complexity Analysis: -

Time complexity- Bubble sort compares the adjacent elements, hence the number of comparisons

                        = ( n – 1 ) + ( n – 2 ) + ( n – 3 ) + ( n – 4 ) + ( n – 5 ) + ( n – 6 ) + ( n – 7 ) + ……… + 1

                        = n ( n - 1 ) / 2

                        = n^2

Time complexity = O ( n^2 )

Worst case: If we want to sort in ascending order and the array is in descending order, then the worst case occurs. Here time complexity will be O( n^2 ).

Best case: If the array is sorted already.

Space complexity- In this solution, we use constant memory. So, space complexity will be O(1).

Uses of bubble sort: It is a very simple algorithm, so it is often used by beginner-level programmers. It is very helpful to understand the basic concept of sorting. In the polygon filling algorithm, it is used. But as its time complexity is very high so in many algorithms, bubble sort is avoided. Instead of bubble sort, in many cases, merge sort or quick sort is used.