Commit 5742bf5

committed

add to bubble sort information about big O complexity and efficiency

1 parent 29d252e commit 5742bf5Copy full SHA for 5742bf5

File tree

-0

lines changed

-0

lines changed

Lines changed: 4 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,5 +1,7 @@`
`1`	`1`	`/*Bubble Sort is a algorithm to sort an array. It`
`2`	`2`	`* compares adjacent element and swaps thier position`
	`3`	`+* The big O on bubble sort in worst and best case is O(N^2).`
	`4`	`+ * Not efficient.`
`3`	`5`	`*/`
`4`	`6`	`function bubbleSort(items) {`
`5`	`7`	`var length = items.length;`
`@@ -25,3 +27,5 @@ console.log(ar);`
`25`	`27`	`bubbleSort(ar);`
`26`	`28`	`//Array after sort`
`27`	`29`	`console.log(ar);`
	`30`	`+`
	`31`	`+`

Comments

(0)