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

add to bubble sort information about big O complexity and efficiency

Browse Source
This commit is contained in:
Abose Ukhun
2017-10-16 11:23:46 +01:00
parent 29d252e8e6
commit 5742bf5009
1 changed files with 4 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
Sorts/bubblesort.js
View File

@ -1,5 +1,7 @@
/*Bubble Sort is a algorithm to sort an array. It /*Bubble Sort is a algorithm to sort an array. It
* compares adjacent element and swaps thier position * 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) { function bubbleSort(items) {
var length = items.length; var length = items.length;
@ -25,3 +27,5 @@ console.log(ar);
bubbleSort(ar); bubbleSort(ar);
//Array after sort //Array after sort
console.log(ar); console.log(ar);