-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathShellSort.cpp
More file actions
82 lines (62 loc) · 1.71 KB
/
ShellSort.cpp
File metadata and controls
82 lines (62 loc) · 1.71 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
///Users/utopia/Documents/iOS/My Project/Shell-Metzner/Shell-Metzner.xcodeproj
// main.cpp
// Shell-Metzner
//
// Created by Utopia on 2017/5/23.
// Copyright © 2017年 Utopia. All rights reserved.
//
#include <iostream>
//希尔排序
void shell_sort(int a[], int len){
for (int step = len/2; step > 0; step = step / 2) {
for (int i = 0; i < step; i++) {
for (int j = i + step; j < len; j = j + step) {
//插入排序
if (a[j - step] > a[j]) {
int insert = a[j];
int k = j - step;
while (k >= 0 && a[k] > insert) {
a[k + step] = a[k];
k = k - step;
}
a[k + step] = insert;
}
}
}
}
}
int numberArray[] = {1, 4, 6, 5, 8, 2};
//快速排序
void quickSort(int left, int right){
int i, j, pivot;
if (left > right) {
return;
}
pivot = numberArray[left];
i = left;
j = right;
while (i != j) {
while (numberArray[j] >= pivot && i < j) {
j -= 1;
}
while (numberArray[i] <= pivot && i < j) {
i += 1;
}
if (i < j) {
int temp = numberArray[i];
numberArray[i] = numberArray[j];
numberArray[j] = temp;
}
}
numberArray[left] = numberArray[i];
numberArray[i] = pivot;
//二分
quickSort(left, i - 1);
quickSort(i + 1, right);
}
int main(int argc, const char * argv[]) {
// insert code here...
int a[5] = {3, 7, 5, 2, 1};
shell_sort(a, 5);
return 0;
}