Skip to content

add c-plus-plus version‘s shell-sort and merge-sort #55

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
shouao merged 8 commits into from
Jan 5, 2022
Merged

add c-plus-plus version‘s shell-sort and merge-sort #55

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
8 commits
Select commit Hold shift + click to select a range
e1b1c66
add cplusplus version in shell-sort and merg-sort
shouao Dec 31, 2021
3125abb
Update 4.shellSort.md
shouao Dec 31, 2021
6773da4
Update 5.mergeSort.md
shouao Dec 31, 2021
0c614a8
Update 5.mergeSort.md
shouao Dec 31, 2021
f62636b
Update 5.mergeSort.md
shouao Dec 31, 2021
4534fa5
Update 5.mergeSort.md
shouao Dec 31, 2021
1f7b01b
Update 5.mergeSort.md
shouao Dec 31, 2021
75cb7d6
Update 4.shellSort.md
shouao Dec 31, 2021
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
20 changes: 20 additions & 0 deletions 4.shellSort.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -144,3 +144,23 @@ function shellSort($arr)
return $arr;
}
```

## 7. C++ 代码实现

```cpp
void shellSort(vector<int>& arr) {
int gap = 1;
while (gap < (int)arr.size() / 3) {
gap = gap * 3 + 1;
}
for (; gap >= 1; gap /= 3) {
for (int i = 0; i < gap; ++i) {
for (int j = i + gap; j < arr.size(); j += gap) {
for (int k = j; k - gap >= 0 && arr[k] < arr[k - gap]; k -= gap) {
swap(arr[k], arr[k - gap]);
}
}
}
}
}
```
39 changes: 38 additions & 1 deletion 5.mergeSort.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -222,4 +222,41 @@ function merge($left, $right)

return $result;
}
```
```

## 9. C++ 代码实现

```cpp
void merge(vector<int>& arr, int l, int mid, int r) {
int index = 0;
int ptrL = l;
int ptrR = mid;
static vector<int>tempary;
if (arr.size() > tempary.size()) {
tempary.resize(arr.size());
}
while (ptrL != mid && ptrR != r) {
if (arr[ptrL] < arr[ptrR]) {
tempary[index++] = arr[ptrL++];
} else {
tempary[index++] = arr[ptrR++];
}
}
while (ptrL != mid) {
tempary[index++] = arr[ptrL++];
}
while (ptrR != r) {
tempary[index++] = arr[ptrR++];
}
copy(tempary.begin(), tempary.begin() + index, arr.begin() + l);
}
void mergeSort(vector<int>& arr, int l, int r) { // sort the range [l, r) in arr
if (r - l <= 1) {
return;
}
int mid = (l + r) / 2;
mergeSort(arr, l, mid);
mergeSort(arr, mid, r);
merge(arr, l, mid, r);
}
```