Commit 94068c7

author

Jason

committed

feat: Selection Sort 选择排序

1 parent 502b191 commit 94068c7Copy full SHA for 94068c7

File tree

+46

-4

lines changed

+46

-4

lines changed

Lines changed: 2 additions & 1 deletion

Lines changed: 2 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -6,7 +6,7 @@`
`6`	`6`	`- other`
`7`	`7`
`8`	`8`	`## Run`
`9`		`-### 以[BubbleSort.cpp](./sorting/BubbleSort.cpp)文件为例运行步骤如下:`
	`9`	`+### 以[QuickSort.cpp](./sorting/QuickSort.cpp)文件为例运行步骤如下:`
`10`	`10`	1. 进入对应目录 `cd sorting`
`11`		-2. 编译cpp文件 `g++ BubbleSort.cpp ./lib/DoubleVector.cp` ,默认会输出 `a.out` 文件 (具体命令视情况而定)
	`11`	+2. 编译cpp文件 `g++ QuickSort.cpp ./lib/DoubleVector.cpp` ,默认会输出 `a.out` 文件 (具体命令视情况而定)
`12`	`12`	3. 执行编译后的文件 `./a.out`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -10,7 +10,7 @@ using namespace std;`
`10`	`10`	`* 整个排序过程只需要三步:`
`11`	`11`	`* (1)在数据集之中,选择一个元素作为"基准"(pivot)。`
`12`	`12`	`* (2)所有小于"基准"的元素,都移到"基准"的左边;所有大于"基准"的元素,都移到"基准"的右边。`
`13`		`- * (3)对"基准"左边和右边的两个子集,不断重复第一步和第二步,直到所有子`
	`13`	`+ * (3)对"基准"左边和右边的两个子集,不断重复第一步和第二步,直到所有子集只剩下一个元素为止`
`14`	`14`	`* 参考链接: https://www.ruanyifeng.com/blog/2011/04/quicksort_in_javascript.html`
`15`	`15`	`*/`
`16`	`16`

Lines changed: 1 addition & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -5,4 +5,5 @@`
`5`	`5`	`- [Quick Sort 快速排序](./QuickSort.cpp)`
`6`	`6`	`- 参考链接`
`7`	`7`	`- [快速排序(Quicksort)的Javascript实现](https://www.ruanyifeng.com/blog/2011/04/quicksort_in_javascript.html)`
	`8`	`+- [Selection Sort 选择排序](./SelectionSort.cpp)`
`8`	`9`	`- other`

Lines changed: 40 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,40 @@`
	`1`	`+#include <iostream>`
	`2`	`+#include <vector>`
	`3`	`+#include <algorithm>`
	`4`	`+#include "./lib/DoubleVector.h"`
	`5`	`+using namespace std;`
	`6`	`+`
	`7`	`+/**`
	`8`	`+ * 选择排序`
	`9`	`+ */`
	`10`	`+`
	`11`	`+int main()`
	`12`	`+{`
	`13`	`+ vector<double> list = cinDoubleVector();`
	`14`	`+`
	`15`	`+ vector<double> selectionSort(vector<double>);`
	`16`	`+ selectionSort(list);`
	`17`	`+`
	`18`	`+ coutDoubleVector(list);`
	`19`	`+`
	`20`	`+ return 0;`
	`21`	`+}`
	`22`	`+`
	`23`	`+vector<double> selectionSort(vector<double> list)`
	`24`	`+{`
	`25`	`+ int len = list.size();`
	`26`	`+ if (len <= 1)`
	`27`	`+ return list;`
	`28`	`+ for (int i = 0; i < len - 1; i++)`
	`29`	`+ {`
	`30`	`+ int minIdx = i;`
	`31`	`+ for (int j = 0; j < len; j++)`
	`32`	`+ {`
	`33`	`+ if (list[j] < list[minIdx])`
	`34`	`+ minIdx = j;`
	`35`	`+ }`
	`36`	`+ swap(list[i], list[minIdx]);`
	`37`	`+ }`
	`38`	`+`
	`39`	`+ return list;`
	`40`	`+}`

Comments

(0)