algorithm/JavaScript
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/JavaScript.git synced 2025-07-05 16:26:47 +08:00
Code Issues Packages Projects Releases Wiki Activity

added the let-statment and fixed a leak.

Browse Source
This commit is contained in:
Christian Bender
2018-03-30 23:40:08 +02:00
parent c83b680311
commit 18349287d1
1 changed files with 8 additions and 8 deletions
Download Patch File Download Diff File Expand all files Collapse all files

16
Sorts/bubblesort.js
View File

@ -4,14 +4,14 @@
* Not efficient. * Not efficient.
*/ */
function bubbleSort(items) { function bubbleSort(items) {
var length = items.length; let length = items.length;
for (var i = (length - 1); i > 0; i--) { for (let i = (length - 1); i > 0; i--) {
//Number of passes //Number of passes
for (var j = (length - i); j > 0; j--) { for (let j = (length - i); j > 0; j--) {
//Compare the adjacent positions //Compare the adjacent positions
if (items[j] < items[j - 1]) { if (items[j] < items[j - 1]) {
//Swap the numbers //Swap the numbers
var tmp = items[j]; let tmp = items[j];
items[j] = items[j - 1]; items[j] = items[j - 1];
items[j - 1] = tmp; items[j - 1] = tmp;
} }
@ -41,12 +41,12 @@ console.log(ar);
*/ */
function bubbleSort(arr){ function bubbleSort(arr){
var swapped = true; let swapped = true;
while(swapped){ while(swapped){
var swapped = false; swapped = false;
for(var i = 0; i < arr.length-1; i++){ for(let i = 0; i < arr.length-1; i++){
if(arr[i] > arr[i + 1]){ if(arr[i] > arr[i + 1]){
var temp = arr[i]; let temp = arr[i];
arr[i] = arr[i + 1]; arr[i] = arr[i + 1];
arr[i + 1] = temp; arr[i + 1] = temp;
swapped = true; swapped = true;