Repository navigation
Expand file tree
/
Copy pathShellSort.cpp
More file actions
74 lines (57 loc) 路 1.5 KB
/
Copy pathShellSort.cpp
File metadata and controls
74 lines (57 loc) 路 1.5 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
#pragma region LICENSE
// Copyright 2019 PaleCosmos
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
#pragma endregion
#include "../Data.h"
void insertion(int *, int, int, int);
void shellSort(int *arr)
{
int gap, i;
for (gap = size / 2; gap > 0; gap = gap / 2)
{
if ((gap % 2) == 0)
{
gap++;
}
for (i = 0; i < gap; i++)
{
insertion(arr, i, size - 1, gap);
}
}
}
int main()
{
clock_t start, end;
int *arr = arrData;
print(arr, "Before");
start = clock();
shellSort(arr);
end = clock();
print(arr, "\nAfter");
timeStamp(start, end); // 3ms
return 0;
}
void insertion(int *arr, int first, int last, int gap)
{
int j, key;
for (int i = first + gap; i <= last; i += gap)
{
key = arr[i];
for (j = i - gap; j >= first && arr[j] > key; j -= gap)
{
arr[j + gap] = arr[j];
}
arr[j + gap] = key;
}
}