Mirrors/interview
1
0
Fork 0
mirror of https://github.com/huihut/interview.git synced 2025-12-18 13:04:38 +03:00
Code Issues Actions Packages Projects Releases Wiki Activity

修改冒泡选择排序的边界值检测

Browse Source
This commit is contained in:
huihut
2018-03-20 10:34:21 +08:00
parent bcc6a28cd1
commit 97d065894c
4 changed files with 8 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
Algorithm/SelectionSort.h
View File

@@ -1,5 +1,7 @@
// 选择排序
void SelectionSort(vector<int>& v) {
if (v.size() <= 0)
return;
int min, temp;
for (int i = 0; i < v.size() - 1; ++i) {
min = i;