w3resource

JavaScript: Sort an array using Bubble Sorting method

JavaScript Object: Exercise-6 with Solution

Bubble Sort

Write a bubble sort algorithm in JavaScript.
Note: Bubble sort is a simple sorting algorithm that works by repeatedly stepping through the list to be sorted,
Sample Data: [6,4,0, 3,-2,1]
Expected Output : [-2, 0, 1, 3, 4, 6]

Sample Solution:

JavaScript Code:

Array.prototype.bubbleSort_algo = function() 
{
var is_sorted = false;
 while (!is_sorted) 
 {
    is_sorted = true;
    for (var n = 0; n < this.length - 1; n++) 
    {
      if (this[n] > this[n+1]){
        var x = this[n+1];
        this[n+1] = this[n];
        this[n] = x;
        is_sorted = false;
      }
    }
  }
  return this;
};

console.log([6,4,0, 3,-2,1].bubbleSort_algo());

Output:

[-2,0,1,3,4,6]

Flowchart:

Flowchart: JavaScript - Sort an array using Bubble Sorting method.

Live Demo:

See the Pen javascript-object-exercise-6 by w3resource (@w3resource) on CodePen.


For more Practice: Solve these Related Problems:

  • Write a JavaScript function that implements bubble sort on an array of numbers and returns the sorted array.
  • Write a JavaScript function that counts the number of swaps performed during bubble sort and logs the count.
  • Write a JavaScript function that uses bubble sort to sort an array of objects based on a specified numeric property.
  • Write a JavaScript function that optimizes bubble sort for nearly sorted arrays and compares its performance with the standard algorithm.

Go to:


PREV : Cylinder Volume.
NEXT : String Subsets.

Improve this sample solution and post your code through Disqus.

What is the difficulty level of this exercise?

Test your Programming skills with w3resource's quiz.



Follow us on Facebook and Twitter for latest update.