Breaking News: Grepper is joining You.com. Read the official announcement!

Bubble sort code implementation in javascript

Add Answer

Depressed Deer answered on March 18, 2020 Popularity 8/10 Helpfulness 5/10

answer Bubble sort code implementation in javascript

related bubble sort javascript

related javascript bubble sort

related bubble sort javascript

related bubble sort in js

related js bubble sort

related Bubble Sort Javascript

related bubble sort js

Bubble sort code implementation in javascript

Comment

function bubbleSort(array) {
    let isSwapped;

    for(let i = array.length; i > 0; i--) {
        isSwapped = false;

        for(let j = 0; j < i - 1; j++) {
            if(array[j] > array[j + 1]) {
                [array[j], array[j+1]] = [array[j+1], array[j]];
                isSwapped = true;
            }
        }

        if(!isSwapped) {
            break;
        }
    }
    return array;
}

Popularity 8/10 Helpfulness 5/10 Language javascript

Source: dev.to

Tags: bubble-sort implementation javascript

Link to this answer
Share Copy Link

Contributed on Sep 17 2022

Depressed Deer

0 Answers Avg Quality 2/10

Closely Related Answers

bubble sort javascript

Comment

bubbleSort(Array) {
    let len = Array.length;
    for (let i = 0; i < len; i++) { //you can also use "for in", so you don't need the variable "len"
        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;
};

Popularity 10/10 Helpfulness 9/10 Language javascript

Source: Grepper

Tags: bubble-sort bubb

Link to this answer
Share Copy Link

Contributed on Mar 18 2020

Anxious Albatross

0 Answers Avg Quality 2/10

javascript bubble sort

Comment

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;
}

Popularity 10/10 Helpfulness 5/10 Language javascript

Source: learn.coderslang.com

Tags: bubble-sort bubb

Link to this answer
Share Copy Link

Contributed on Feb 20 2021

Mysterious Monkey

0 Answers Avg Quality 2/10

bubble sort javascript

Comment

function bubbleSort(arr){ 
   const length = arr.length;
   let isSwapped = false;
  
    for(let i = 0; i < length; i++){
        for(let j = 0; j < length; j++){
            if(arr[j] > arr[j+1]){
                //swap
                let temp = arr[j];
                arr[j] = arr[j+1];
                arr[j+1] = temp;
              isSwapped = true;
            }
        }
      // IF no two elements were swapped by inner loop, then break
      //i.e. array is already sorted
      if(!isSwapped) break;
    }
    return arr;
}

let a = [99,44,6,2,1,5,63,87,283,4,0];
console.log(bubbleSort(a));

Popularity 9/10 Helpfulness 4/10 Language javascript

Source: Grepper

Tags: bubble-sort bubb

Link to this answer
Share Copy Link

Contributed on Aug 13 2022

Aditya Pratap Singh

0 Answers Avg Quality 2/10

bubble sort in js

Comment

function bubbleSort(arr) {
  var len = arr.length;
  var isSwapped;
  for (var i = 0; i < len - 1; i++) {
    isSwapped = false;
    for (var j = 0; j < len - i - 1; j++) {
      if (arr[j] > arr[j + 1]) {
        // Swap elements
        var temp = arr[j];
        arr[j] = arr[j + 1];
        arr[j + 1] = temp;
        isSwapped = true;
      }
    }

    // If no two elements were swapped in the inner loop, the array is already sorted
    if (!isSwapped) {
      break;
    }
  }
  
  return arr;
}

// Example usage
var numbers = [5, 3, 8, 4, 2];
console.log(bubbleSort(numbers)); // Output: [2, 3, 4, 5, 8]

Popularity 6/10 Helpfulness 4/10 Language javascript

Source: Grepper

Link to this answer
Share Copy Link

Contributed on Sep 11 2023

YOU.com

0 Answers Avg Quality 2/10

js bubble sort

Comment

// Bubble sort is a sorting algorithm that sorts data in an array by looping through the array
// and checking if the current item is greater than the next item.
// It will continue to loop through, swapping the items until they are sorted.
// If no swaps are made during a pass, then the data is sorted and we break the loop.

const bubbleSort = (arr) => {
  // This variable is used to either continue or stop the loop
  let continueSorting = true;

  // while continueSorting is true
  while (continueSorting) {
    // Here we are setting continueSorting to false. Because below we check to see if a swap is made,
    // if a swap is made, then we continue sorting. If no swaps were made, then were are done sorting,
    // and stop our while loop.
    continueSorting = false

    // loop through the arr from 0 to next to last
    for(let i = 0; i < arr.length - 1; i++) {
      // check if we need to swap
      if(arr[i] > arr[i + 1]) {
        // swap
        let temp = arr[i];
        arr[i] = arr[i + 1];
        arr[i + 1] = temp;

        // since a swap was made, we want to continue sorting
        continueSorting = true;
      }
    }
  }

  // After all swaps have been made, then we return our sorted array
  return arr;
}

// Tests
console.log(bubbleSort([9, 8, 7, 6, 5, 4, 3, 2, 1] ));
console.log(bubbleSort([1, 2, 3, 4, 5, 6, 7, 8, 9] ));

Popularity 9/10 Helpfulness 4/10 Language javascript

Source: Grepper

Tags: bubble-sort bubb

Link to this answer
Share Copy Link

Contributed on Jun 01 2022

Jarett Sisk

0 Answers Avg Quality 2/10

Bubble Sort Javascript

Comment

//Bubble Sort using Javascript

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;
};

Popularity 8/10 Helpfulness 2/10 Language javascript

Source: flexiple.com

Tags: bubble-sort bubb

Link to this answer
Share Copy Link

Contributed on Sep 23 2022

Uptight Unicorn

0 Answers Avg Quality 2/10

Bubble Sort Javascript

Comment

/*A slightly better solution involves tracking a variable called "checked" 
which is initially set to FALSE and becomes true when there is a swap during the iteration. 
Running this code on a do while loop to run the sorting function only when "checked" is true 
ensures that the function will not run on a sorted array more than once.*/
[visualization](https://visualgo.net/en/sorting?slide=1);

let bubbleSort = (inputArr) => {
    let len = inputArr.length;
    let checked;
    do {
        checked = false;
        for (let i = 0; i < len; i++) {
            if (inputArr[i] > inputArr[i + 1]) {
                let tmp = inputArr[i];
                inputArr[i] = inputArr[i + 1];
                inputArr[i + 1] = tmp;
                checked = true;
            }
        }
    } while (checked);
    return inputArr;
};

Popularity 8/10 Helpfulness 1/10 Language javascript

Source: flexiple.com

Tags: bubble-sort bubb

Link to this answer
Share Copy Link

Contributed on Sep 23 2022

Uptight Unicorn

0 Answers Avg Quality 2/10

bubble sort js

Comment

function bubbleSort(arr) {
    const n = arr.length;

    for (let i = 0; i < n - 1; i++) {
        // Last i elements are already in place, so we can skip them
        for (let j = 0; j < n - i - 1; j++) {
            // Compare adjacent elements and swap if necessary
            if (arr[j] > arr[j + 1]) {
                // Swap arr[j] and arr[j + 1]
                const temp = arr[j];
                arr[j] = arr[j + 1];
                arr[j + 1] = temp;
            }
        }
    }
}

const arrayToSort = [64, 34, 25, 12, 22, 11, 90];
bubbleSort(arrayToSort);
console.log("Sorted array:", arrayToSort);

Popularity 5/10 Helpfulness 1/10 Language javascript

Source: chat.openai.com

Tags: bubble-sort javascript

Link to this answer
Share Copy Link

Contributed on Aug 10 2023

Coder Tawhid

0 Answers Avg Quality 2/10

bubble sort js

Comment

function bubbleSort(nums) {
  let swapped = false;
  let iterations = 0;
  do {
    swapped = false;
    for (let i = 0; i < nums.length - iterations - 1; i++) {
      if (nums[i] > nums[i + 1]) {
        [nums[i], nums[i + 1]] = [nums[i + 1], nums[i]];
        swapped = true;
      }
    }
    iterations++;
  } while (swapped);
  return nums;
}

Popularity 9/10 Helpfulness 1/10 Language javascript

Source: Grepper

Tags: bubble-sort bubb

Link to this answer
Share Copy Link

Contributed on Apr 26 2022

FADL

0 Answers Avg Quality 2/10

Bubble sort code implementation in javascript

Contents

More Related Answers

Bubble sort code implementation in javascript

Closely Related Answers

bubble sort javascript

javascript bubble sort

bubble sort javascript

bubble sort in js

js bubble sort

Bubble Sort Javascript

Bubble Sort Javascript

bubble sort js

bubble sort js

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.