Commit 7a3bbf9

committed

fix Aha-Algorithms chapter1

1 parent 6a90f22 commit 7a3bbf9Copy full SHA for 7a3bbf9

File tree

+44

-24

lines changed

+44

-24

lines changed

Lines changed: 5 additions & 22 deletions

Original file line number	Diff line number	Diff line change
`@@ -19,31 +19,14 @@ console.log('排序数组', arr);`
`19`	`19`	`* @returns {Array}`
`20`	`20`	`*/`
`21`	`21`	`function bubbleSort(arr) {`
`22`		`- let len = arr.length;`
`23`		`- for (let i = 0; i < len - 1; i++) {`
`24`		`- for (let j = i + 1; j < len; j++) {`
`25`		`- if (arr[i] > arr[j]) {`
`26`		`- [arr[i], arr[j]] = [arr[j], arr[i]]`
`27`		`- }`
`28`		`- }`
`29`		`- }`
`30`		`- return arr;`
`31`		`-}`
`32`		`-`
`33`		`-/**`
`34`		`- * 冒泡排序,从小到大排序,把最大的数放到末尾`
`35`		`- * @param arr`
`36`		`- * @returns {Array}`
`37`		`- */`
`38`		`-function bubbleSort2(arr) {`
`39`		`- let len = arr.length;`
`40`		`- for (let i = 0; i < len - 1; i++) {`
`41`		`- for (let j = 0; j < len - i - 1; j++) {`
`42`		`- if (arr[j] > arr[j + 1]) {`
	`22`	`+ let length = arr.length;`
	`23`	`+ for (let i = 0; i < length - 1; i++) {`
	`24`	`+ for (let j = 0; j < length - 1 - i; j++) {`
	`25`	`+ if (arr[j] > arr[j + 1]) { // 修改这判断,可以改成从大到小排序`
`43`	`26`	`[arr[j], arr[j + 1]] = [arr[j + 1], arr[j]]`
`44`	`27`	`}`
`45`	`28`	`}`
`46`	`29`	`}`
`47`		`- return arr;`
	`30`	`+ return arr`
`48`	`31`	`}`
`49`	`32`

Lines changed: 1 addition & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -25,6 +25,7 @@`
`25`	`25`
`26`	`26`	`由于算法复杂度高,但是比较容易掌握,一般都作为入门算法,我反正大学毕业了也只会这一种,正式场合慎用。`
`27`	`27`
	`28`	+> 我多实现了一种算法 sort_selection.js `选择排序`,用于跟冒泡排序比较,方便理解区分这两种算法
`28`	`29`
`29`	`30`	`## 快速排序`
`30`	`31`

Lines changed: 33 additions & 0 deletions

Lines changed: 5 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -10,12 +10,15 @@`
`10`	`10`	`> [Leetcode Solutions with JavaScript](https://github.com/hanzichi/leetcode)`
`11`	`11`	`> [LeetCode-in-Go](https://github.com/aQuaYi/LeetCode-in-Go)`
`12`	`12`
`13`		`-工具`
	`13`	`+工具`
`14`	`14`	`> [leetcode cli](https://github.com/skygragon/leetcode-cli) 针对 https://leetcode.com/ 使用`
`15`	`15`
`16`		`-目录`
	`16`	`+目录`
`17`	`17`	`- [《啊哈!算法》代码 JS 实现](./Aha-Algorithms)`
`18`	`18`	`- [《算法图解》代码 JS 实现](./Grokking-Algorithms)`
`19`	`19`	`- [ LeetCode Algorithms ](./LeetCode)`
`20`	`20`	`- [ 笔记 Notes ](./notes)`
`21`	`21`
	`22`	`+使用`
	`23`	+由于运行代码依赖工具类 util.js,LeetCode/leetcode.js ,所以需要先安装依赖包,在根目录执行 `yarn install` 即可
	`24`	`+`

Comments

(0)