StarMirror/cpp-interview
1
0
Fork 0
mirror of https://github.com/huihut/interview.git synced 2024-03-22 13:10:48 +08:00
Code Issues 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
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

3
.vscode/settings.json vendored
View File

@ -11,6 +11,7 @@
"streambuf": "cpp", "streambuf": "cpp",
"tuple": "cpp", "tuple": "cpp",
"system_error": "cpp", "system_error": "cpp",
"xtr1common": "cpp" "xtr1common": "cpp",
"limits": "cpp"
} }
} }

2
Algorithm/BubbleSort.h
View File

@ -1,5 +1,7 @@
// 冒泡排序 // 冒泡排序
void BubbleSort(vector<int>& v) { void BubbleSort(vector<int>& v) {
if (v.size() <= 0)
return;
int temp; int temp;
for (int i = 0; i < v.size() - 1; ++i) { for (int i = 0; i < v.size() - 1; ++i) {
for (int j = 0; j < v.size() - 1 - i; ++j) { for (int j = 0; j < v.size() - 1 - i; ++j) {

2
Algorithm/BubbleSort_orderly.h
View File

@ -1,5 +1,7 @@
// 冒泡排序（改进版） // 冒泡排序（改进版）
void BubbleSort_orderly(vector<int>& v) { void BubbleSort_orderly(vector<int>& v) {
if (v.size() <= 0)
return;
int temp; int temp;
bool orderly = false; bool orderly = false;
for (int i = 0; i < v.size() - 1 && !orderly; ++i) { for (int i = 0; i < v.size() - 1 && !orderly; ++i) {

2
Algorithm/SelectionSort.h
View File

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