File tree Expand file tree Collapse file tree 2 files changed +40
-11
lines changed Expand file tree Collapse file tree 2 files changed +40
-11
lines changed Original file line number Diff line number Diff line change 16
16
17
17
![ 动图演示] ( res/selectionSort.gif )
18
18
19
+ ## 3. C++代码实现
20
+
19
21
``` cpp
20
22
void changeValue (int * a, int * b)
21
23
{
@@ -30,7 +32,6 @@ void changeValue(int *a, int *b)
30
32
vector<int > AlgorithmSort::selectionSort(vector<int > vec)
31
33
{
32
34
int len = vec.size();
33
- int min = 0;
34
35
//边界值判定
35
36
if (len <= 1)
36
37
return vec;
@@ -57,7 +58,7 @@ vector<int> AlgorithmSort::selectionSort(vector<int> vec)
57
58
}
58
59
```
59
60
60
- ## 3 . JavaScript 代码实现
61
+ ## 4 . JavaScript 代码实现
61
62
62
63
```js
63
64
function selectionSort(arr) {
@@ -78,7 +79,7 @@ function selectionSort(arr) {
78
79
}
79
80
```
80
81
81
- ## 4 . Python 代码实现
82
+ ## 5 . Python 代码实现
82
83
83
84
``` python
84
85
def selectionSort (arr ):
@@ -94,7 +95,7 @@ def selectionSort(arr):
94
95
return arr
95
96
```
96
97
97
- ## 5 . Go 代码实现
98
+ ## 6 . Go 代码实现
98
99
99
100
``` go
100
101
func selectionSort (arr []int ) []int {
@@ -112,7 +113,7 @@ func selectionSort(arr []int) []int {
112
113
}
113
114
```
114
115
115
- ## 6 . Java 代码实现
116
+ ## 7 . Java 代码实现
116
117
117
118
``` java
118
119
public class SelectionSort implements IArraySort {
@@ -146,7 +147,7 @@ public class SelectionSort implements IArraySort {
146
147
}
147
148
```
148
149
149
- ## 7 . PHP 代码实现
150
+ ## 8 . PHP 代码实现
150
151
151
152
``` php
152
153
function selectionSort($arr)
Original file line number Diff line number Diff line change 16
16
17
17
![ 动图演示] ( res/insertionSort.gif )
18
18
19
+ ## 3. C++代码实现
20
+ ``` cpp
21
+ void changeValue (int * a, int * b)
22
+ {
23
+ int temp = * a;
24
+ * a = * b;
25
+ * b = temp;
26
+ }
27
+ //插入排序
28
+ vector<int > AlgorithmSort::insertionSort(vector<int > vec)
29
+ {
30
+ int len = vec.size();
31
+ //边界值判定
32
+ if (len <= 1)
33
+ return vec;
34
+
35
+ for (int i = 0; i < len; i++)
36
+ {
37
+ for (int j = len-1; j > 0; j--)
38
+ {
39
+ if (vec[j-1] > vec[j])
40
+ changeValue(&vec[j-1], &vec[j]);
41
+ }
42
+ }
43
+
44
+ return vec;
45
+ }
46
+ ```
19
47
20
- ## 3 . JavaScript 代码实现
48
+ ## 4 . JavaScript 代码实现
21
49
22
50
```js
23
51
function insertionSort(arr) {
@@ -36,7 +64,7 @@ function insertionSort(arr) {
36
64
}
37
65
```
38
66
39
- ## 4 . Python 代码实现
67
+ ## 5 . Python 代码实现
40
68
41
69
``` python
42
70
def insertionSort (arr ):
@@ -50,7 +78,7 @@ def insertionSort(arr):
50
78
return arr
51
79
```
52
80
53
- ## 5 . Go 代码实现
81
+ ## 6 . Go 代码实现
54
82
``` go
55
83
func insertionSort (arr []int ) []int {
56
84
for i := range arr {
@@ -66,7 +94,7 @@ func insertionSort(arr []int) []int {
66
94
}
67
95
```
68
96
69
- ## 6 . Java 代码实现
97
+ ## 7 . Java 代码实现
70
98
71
99
``` java
72
100
public class InsertSort implements IArraySort {
@@ -100,7 +128,7 @@ public class InsertSort implements IArraySort {
100
128
}
101
129
```
102
130
103
- ## 7 . PHP 代码实现
131
+ ## 8 . PHP 代码实现
104
132
105
133
``` php
106
134
function insertionSort($arr)
You can’t perform that action at this time.
0 commit comments