Skip to content

Commit 18e2630

Browse files
committed
add insertionSort cpp program
add insertionSort cpp program
1 parent 89ce6da commit 18e2630

File tree

2 files changed

+40
-11
lines changed

2 files changed

+40
-11
lines changed

2.selectionSort.md

Lines changed: 7 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -16,6 +16,8 @@
1616

1717
![动图演示](res/selectionSort.gif)
1818

19+
## 3. C++代码实现
20+
1921
```cpp
2022
void changeValue(int *a, int *b)
2123
{
@@ -30,7 +32,6 @@ void changeValue(int *a, int *b)
3032
vector<int> AlgorithmSort::selectionSort(vector<int> vec)
3133
{
3234
int len = vec.size();
33-
int min = 0;
3435
//边界值判定
3536
if (len <= 1)
3637
return vec;
@@ -57,7 +58,7 @@ vector<int> AlgorithmSort::selectionSort(vector<int> vec)
5758
}
5859
```
5960
60-
## 3. JavaScript 代码实现
61+
## 4. JavaScript 代码实现
6162
6263
```js
6364
function selectionSort(arr) {
@@ -78,7 +79,7 @@ function selectionSort(arr) {
7879
}
7980
```
8081

81-
## 4. Python 代码实现
82+
## 5. Python 代码实现
8283

8384
```python
8485
def selectionSort(arr):
@@ -94,7 +95,7 @@ def selectionSort(arr):
9495
return arr
9596
```
9697

97-
## 5. Go 代码实现
98+
## 6. Go 代码实现
9899

99100
```go
100101
func selectionSort(arr []int) []int {
@@ -112,7 +113,7 @@ func selectionSort(arr []int) []int {
112113
}
113114
```
114115

115-
## 6. Java 代码实现
116+
## 7. Java 代码实现
116117

117118
```java
118119
public class SelectionSort implements IArraySort {
@@ -146,7 +147,7 @@ public class SelectionSort implements IArraySort {
146147
}
147148
```
148149

149-
## 7. PHP 代码实现
150+
## 8. PHP 代码实现
150151

151152
```php
152153
function selectionSort($arr)

3.insertionSort.md

Lines changed: 33 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -16,8 +16,36 @@
1616

1717
![动图演示](res/insertionSort.gif)
1818

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+
```
1947
20-
## 3. JavaScript 代码实现
48+
## 4. JavaScript 代码实现
2149
2250
```js
2351
function insertionSort(arr) {
@@ -36,7 +64,7 @@ function insertionSort(arr) {
3664
}
3765
```
3866

39-
## 4. Python 代码实现
67+
## 5. Python 代码实现
4068

4169
```python
4270
def insertionSort(arr):
@@ -50,7 +78,7 @@ def insertionSort(arr):
5078
   return arr
5179
```
5280

53-
## 5. Go 代码实现
81+
## 6. Go 代码实现
5482
```go
5583
func insertionSort(arr []int) []int {
5684
for i := range arr {
@@ -66,7 +94,7 @@ func insertionSort(arr []int) []int {
6694
}
6795
```
6896

69-
## 6. Java 代码实现
97+
## 7. Java 代码实现
7098

7199
```java
72100
public class InsertSort implements IArraySort {
@@ -100,7 +128,7 @@ public class InsertSort implements IArraySort {
100128
}
101129
```
102130

103-
## 7. PHP 代码实现
131+
## 8. PHP 代码实现
104132

105133
```php
106134
function insertionSort($arr)

0 commit comments

Comments
 (0)