FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
competitive-programming/Sort.cpp at master · harrypotter0/competitive-programming · GitHub
harrypotter0
competitive-programming
Repository navigation
Code
Issues
1
(1)
Pull requests
2
(2)
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
competitive-programming
/
Sort.cpp
Copy path
More file actions
More file actions
Latest commit
History
History
History
146 lines (138 loc) · 2.6 KB
Breadcrumbs
competitive-programming
/
Sort.cpp
Copy path
File metadata and controls
146 lines (138 loc) · 2.6 KB
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
template
<
typename
data_type>
void
shellSort
( vector<data_type> & vec )
{
int
gap=
1
;
int
n=vec.
size
();
while
((gap<<
1
+
1
)< (n>>
1
))
gap=(gap<<
1
+
1
);
for
(;gap>
0
;gap>>=
1
)
{
for
(
int
i=gap;i<n;i++)
{
int
temp=
std::move
(vec[i]);
int
j;
for
(j=i;j>=gap && vec[j-gap]>temp;j-=gap)
vec[j]=
std::move
(vec[j-gap]);
vec[j]=temp;
}
}
}
template
<
typename
data_type>
void
insertionSort
( vector<data_type> & vec )
{
for
(
int
i=
1
;i<n;i++)
{
int
temp=
std::move
(vec[i]);
int
j;
for
(j=i;j>
0
&& vec[j-
1
]>temp;j--)
vec[j]=
std::move
(vec[j-
1
]);
vec[j]=temp;
}
}
template
<
typename
data_type>
void
countingSort
(vector<data_type>&vec)
{
if
(n<=
1
)
return
;
int
beg=
1000000008
,end=-
1000000008
;
for
(
int
i=
0
;i<n;i++)
{
if
(vec[i]<beg)
beg=vec[i];
if
(vec[i]>end)
end=vec[i];
}
int
n=end-beg+
1
;
int
data[n];
for
(
int
i=
0
;i<n;i++)
data[i]=
0
;
for
(
int
i=
0
;i<vec.
size
();i++)
data[vec[i]-beg]++;
int
pos=
0
;
for
(
int
i=
0
;i<n;i++)
{
for
(
int
j=data[i];j>
0
;j--)
{
vec[pos++]=i+beg;
}
}
}
template
<
typename
data_type>
void
radixSort
(vector<data_type>&arr)
{
data_type m=*(
max_element
(arr.
begin
(),arr.
end
()));
for
(data_type div=
1
; m/div ; div*=
10
)
{
vector<data_type>data[
10
];
for
(
int
i=
0
;i<arr.
size
();i++)
data[(arr[i]/div)%
10
].
push_back
(arr[i]);
int
pos=
0
;
for
(
int
i=
0
;i<
10
;i++)
{
std::copy_n
(data[i].
begin
(),data[i].
size
(),arr.
begin
()+pos);
pos+=data[i].
size
();
}
}
}
void
mergeSort
(
auto
begin ,
auto
end)
{
if
(end-begin>
1
)
{
mergeSort
(begin,begin+(end-begin)/
2
);
mergeSort
(begin+(end-begin)/
2
,end);
vector<
int
>
arr
(end-begin);
merge
(begin ,begin+(end-begin)/
2
,begin+(end-begin)/
2
,end ,arr.
begin
());
copy
(arr.
begin
(),arr.
end
(),begin);
}
}
void
heapify
(vector<data_type>&arr,
int
&n,
int
i)
{
int
largest=i;
int
l=
2
*i+
1
;
int
r=
2
*i+
2
;
if
(l<n
and
arr[i]<arr[l])
i=l;
if
(r<n
and
arr[i]<arr[r])
i=r;
if
(largest != i)
{
swap
(arr[i],arr[largest]);
heapify
(arr,n,i);
}
}
void
heapSort
(vector<data_type>&arr)
{
int
n=arr.
size
();
for
(
int
i=n/
2
;i>=
0
;i--)
{
heapify
(arr,n,i);
}
for
(
int
i=n-
1
;i>=
0
;i--)
{
swap
(arr[
0
],arr[i]);
heapify
(arr,i,
0
);
}
}
int
partition
(vector<data_type>&arr,
int
low,
int
high)
{
int
i=low-
1
;
for
(
int
j=low;j<high;j++)
{
if
(arr[j]<arr[high])
{
i++;
swap
(arr[j],arr[i]);
}
}
swap
(arr[high],arr[i+
1
]);
return
i+
1
;
}
void
quickSort
(vector<data_type>&arr,
int
low,
int
high)
{
if
(low<high)
{
int
pi=
partition
(arr,low,high);
quickSort
(arr,low,pi-
1
);
quickSort
(arr,pi+
1
,high);
}
}
Back
|
FazBrowse Home
|
New Git URL