bubble sort algorithm js code example
Example 1: bubble sort javascript
bubbleSort(Array) {
let len = Array.length;
for (let i = 0; i < len; i++) {
for (let j = 0; j < len; j++) {
if (Array[j] > Array[j + 1]) {
let tmp = Array[j];
Array[j] = Array[j + 1];
Array[j + 1] = tmp;
}
}
}
return Array;
};
Example 2: javascript bubble sort
const bubbleSort = (arr) => {
for (let i = 0; i < arr.length; i++) {
for (let j = 0; j < arr.length - i; j++) {
if (arr[j] > arr[j + 1]) {
let tmp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = tmp;
}
}
}
return arr;
}
Example 3: bubble sort javascript
function bubblesort(array) {
len = array.length;
for (let i = 0; i < len; i++) {
for (let j = 0; j < len - i; j++) {
let a = array[j];
if (a != array[-1]) {
var b = array[j + 1];
if (a > b) {
array[j] = b;
array[j + 1] = a;
}
}
}
}
}
let array = [10, 9, 8, 7, 6, 5, 4, 3, 2, 1];
bubblesort(array);
console.log(array)
Example 4: javascript bubleshort example
function bubbleReverse(arr) {
for (let i = arr.length - 1; i > 0; i--) {
for (let j = arr.length - 1; j > 0; j--) {
if (arr[j] > arr[j - 1]) {
let temp = arr[j];
arr[j] = arr[j - 1];
arr[j - 1] = temp;
}
}
}
return arr;
}
function bubbleSort(arr) {
for (let i = 0; i < arr.length - 1; i++) {
for (let j = 0; j < arr.length - 1; j++) {
if (arr[j] > arr[j + 1]) {
let temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
}
}
}
return arr;
}
Example 5: buble sort in js
let bubbleSort = (inputArr) => { let len = inputArr.length; for (let i = 0; i < len; i++) { for (let j = 0; j < len; j++) { if (inputArr[j] > inputArr[j + 1]) { let tmp = inputArr[j]; inputArr[j] = inputArr[j + 1]; inputArr[j + 1] = tmp; } } } return inputArr;};
Example 6: bubble sort javascript
function bubbleSort(array) {
const len = array.length;
const retArray = array;
for (let i = 0; i < len; i++) {
for (let j = 0; j < len - i; j++) {
const a = array[j];
if (a !== array[-1]) {
const b = array[j + 1];
if (a > b) {
retArray[j] = b;
retArray[j + 1] = a;
}
}
}
}
return retArray;
}
bubbleSort([10, 9, 8, 7, 6, 5, 4, 3, 2, 1]);