algorithm/JavaScript
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/JavaScript.git synced 2025-07-06 01:18:23 +08:00
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #34 from bexis13/print

Browse Source 
add last console printing to show after sorting
This commit is contained in:
Mohit Sharma
2017-10-18 18:26:23 +05:30
committed by GitHub
parent b0a49fdb6f 28343d2cc3
commit 41705e6977
1 changed files with 39 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

39
Sorts/bubblesort.js
View File

@ -1,5 +1,7 @@
/*Bubble Sort is a algorithm to sort an array. It
* compares adjacent element and swaps thier position
* The big O on bubble sort in worst and best case is O(N^2).
* Not efficient.
*/
function bubbleSort(items) {
var length = items.length;
@ -21,7 +23,44 @@ function bubbleSort(items) {
var ar=[5,6,7,8,1,2,12,14];
//Array before Sort
console.log("-----before sorting-----")
console.log(ar);
bubbleSort(ar);
//Array after sort
console.log("-----after sorting-----")
console.log(ar);
/*alternative implementation of bubble sort algorithm.
Using a while loop instead. For educational purposses only
*/
/*
*In bubble sort, we keep iterating while something was swapped in
*the previous inner-loop iteration. By swapped I mean, in the
*inner loop iteration, we check each number if the number proceeding
*it is greater than itself, if so we swap them.
*/
function bubbleSort(arr){
var swapped = true;
while(swapped){
var swapped = false;
for(var i = 0; i < arr.length; i++){
if(arr[i] > arr[i + 1]){
var temp = arr[i];
arr[i] = arr[i + 1];
arr[i + 1] = temp;
swapped = true;
}
}
}
return arr;
}
//test
console.log("-----before sorting-----")
var array = [10,5,3,8,2,6,4,7,9,1];
console.log(array);
console.log("-----after sorting-----")
console.log(bubbleSort(array));