Работа сортировки с любыми типами данных
06.01.2013, 15:22. Показов 697. Ответов 2
Есть вот такая сортировка:
| C++ | 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
| typedef struct node_t *node, node_t;
struct node_t { int v; node next; };
typedef struct { node head, tail; } slist;
void push(slist *l, node e) {
if (!l->head) l->head = e;
if (l->tail) l->tail->next = e;
l->tail = e;
}
node removehead(slist *l) {
node e = l->head;
if (e) {
l->head = e->next;
e->next = 0;
}
return e;
}
void join(slist *a, slist *b) {
push(a, b->head);
a->tail = b->tail;
}
void merge(slist *a, slist *b) {
slist r = {0};
while (a->head && b->head)
push(&r, removehead(a->head->v <= b->head->v ? a : b));
join(&r, a->head ? a : b);
*a = r;
b->head = b->tail = 0;
}
void sort(int *ar, int len)
{
node_t all[len];
// array to list
for (int i = 0; i < len; i++)
all[i].v = ar[i], all[i].next = i < len - 1 ? all + i + 1 : 0;
slist list = {all, all + len - 1}, rem, strand = {0}, res = {0};
for (node e = 0; list.head; list = rem) {
rem.head = rem.tail = 0;
while ((e = removehead(&list)))
push((!strand.head || e->v >= strand.tail->v) ? &strand : &rem, e);
merge(&res, &strand);
}
// list to array
for (int i = 0; res.head; i++, res.head = res.head->next)
ar[i] = res.head->v;
}
void show(const char *title, int *x, int len)
{
printf("%s ", title);
for (int i = 0; i < len; i++)
printf("%3d ", x[i]);
putchar('\n');
}
int main(void)
{
int x[] = {-2,0,-2,5,5,3,-1,-3,5,5,0,2,-4,4,2};
# define SIZE sizeof(x)/sizeof(int)
show("before sort:", x, SIZE);
sort(x, sizeof(x)/sizeof(int));
show("after sort: ", x, SIZE);
return 0;
} |
|
Нужно адаптировать к работе с любыми типами данных, я вот что сделал:
| C++ | 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
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
| // temp.cpp: определяет точку входа для консольного приложения.
//
#include "stdafx.h"
#include <string>
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
template <class T>
void strand(T *ar, int len);
template<typename Iterator>
void strand(Iterator const first, Iterator const last) {
strand(&*first, static_cast<int>(distance(first, last)));
}
template<typename Container>
void strand(Container &container) {
strand(container.begin(), container.end());
}
template<typename Value, int N>
void strand(Value (&array)[N]) {
strand(&array[0], N);
}
typedef struct node_t *node, node_t;
template <class T>
struct node_t { T v; node next; };
typedef struct { node head, tail; } slist;
//Класс Sort как собственный тип данных
class Sort{
public:
string data;
int id;
Sort(){}
~Sort(){}
Sort(int _id) : id(_id)
{
}
Sort(int _id, string _data) : id(_id), data(_data)
{ }
void print()
{
cout << this->id << " " << this->data << endl;
}
bool operator>(Sort &obj1)
{
return (this->id) > (obj1.id);
}
bool operator<(Sort &obj1)
{
return (this->id) < (obj1.id);
}
bool operator==(Sort &obj1)
{
return (this->id)==(obj1.id);
}
bool operator!=(Sort &obj1)
{
return (this->id)!=(obj1.id);
}
bool operator<=(Sort &obj1)
{
return (this->id)<=(obj1.id);
}
bool operator>=(Sort &obj1)
{
return (this->id)>=(obj1.id);
}
};
template <class T>
void push(slist *l, node e) {
if (!l->head) l->head = e;
if (l->tail) l->tail->next = e;
l->tail = e;
}
template <class T>
node removehead(slist *l) {
node e = l->head;
if (e) {
l->head = e->next;
e->next = 0;
}
return e;
}
template <class T>
void join(slist *a, slist *b) {
push(a, b->head);
a->tail = b->tail;
}
template <class T>
void merge(slist *a, slist *b) {
slist r = {0};
while (a->head && b->head)
push(&r, removehead(a->head->v <= b->head->v ? a : b));
join(&r, a->head ? a : b);
*a = r;
b->head = b->tail = 0;
}
template <class T>
void strand(T *ar, int len)
{
node_t all[len];
// array to list
for (int i = 0; i < len; i++)
all[i].v = ar[i], all[i].next = i < len - 1 ? all + i + 1 : 0;
slist list = {all, all + len - 1}, rem, strand = {0}, res = {0};
for (node e = 0; list.head; list = rem) {
rem.head = rem.tail = 0;
while ((e = removehead(&list)))
push((!strand.head || e->v >= strand.tail->v) ? &strand : &rem, e);
merge(&res, &strand);
}
// list to array
for (int i = 0; res.head; i++, res.head = res.head->next)
ar[i] = res.head->v;
}
int _tmain(int argc, _TCHAR* argv[])
{
Sort s1(1,"qw"); Sort s2(2,"asd"); Sort s3(3,"zxxcv"); Sort s4(99,"3245");
Sort s5(2,"zvbn"); Sort s6(5,"ouid"); Sort s7(78,"qw");Sort s8(29,"lkjgh");
cout << "Strand Sort:" << endl;
vector<Sort> data;
data.push_back(s1); data.push_back(s2); data.push_back(s3); data.push_back(s4);
data.push_back(s5); data.push_back(s6); data.push_back(s7); data.push_back(s8);
vector<char> charDatav1;
charDatav1.push_back('q'); charDatav1.push_back('g'); charDatav1.push_back('v'); charDatav1.push_back('z'); charDatav1.push_back('w');
charDatav1.push_back('p'); charDatav1.push_back('n'); charDatav1.push_back('b');
cout << " In_place merge sort\nVector<char>: " << endl;
strand(&charDatav1[0], &charDatav1[0] + charDatav1.size());
for(size_t i = 0; i < data.size(); i++)
cout << charDatav1[i] << " ";
cout << endl << endl;
vector<int> intDatav1;
intDatav1.push_back(4); intDatav1.push_back(23); intDatav1.push_back(12); intDatav1.push_back(101); intDatav1.push_back(78);
intDatav1.push_back(89); intDatav1.push_back(67); intDatav1.push_back(54);
cout << " In_place merge sort\nVector<Int>: " << endl;
strand(&intDatav1[0], &intDatav1[0] + intDatav1.size());
for(size_t i = 0; i < intDatav1.size(); i++)
cout << intDatav1[i] << " ";
cout << endl << endl;
vector<double> doubleDatav1;
doubleDatav1.push_back(4.7); doubleDatav1.push_back(4.2); doubleDatav1.push_back(5.8); doubleDatav1.push_back(6.2); doubleDatav1.push_back(78.9);
doubleDatav1.push_back(1.1); doubleDatav1.push_back(91.2); doubleDatav1.push_back(111.3);
cout << " In_place merge sort\nVector<Double>: " << endl;
strand(&doubleDatav1[0], &doubleDatav1[0] + doubleDatav1.size());
for(size_t i = 0; i < doubleDatav1.size(); i++)
cout << doubleDatav1[i] << " ";
cout << endl << endl;
vector<Sort> SortDatav1;
SortDatav1.push_back(s1); SortDatav1.push_back(s2); SortDatav1.push_back(s3); SortDatav1.push_back(s4);
SortDatav1.push_back(s5); SortDatav1.push_back(s6); SortDatav1.push_back(s7); SortDatav1.push_back(s8);
cout << " In_place merge sort\nVector<user type>: " << endl;
strand(&SortDatav1[0], &SortDatav1[0] + SortDatav1.size());
for(size_t i = 0; i < SortDatav1.size(); i++)
SortDatav1[i].print();
cout << endl << endl;
////////////////////////////////////////////////////
const int kol = 8;
cout << " In-place merge sort: " << endl;
cout << "User Type mas[]: " << endl;
Sort mas2[kol];
mas2[0] = s1; mas2[1] = s2; mas2[2] = s3; mas2[3] = s4; mas2[4] = s5; mas2[5] = s6; mas2[6] = s7; mas2[7] = s8;
strand(mas2, kol);
for (int i = 0; i < kol; i++){
mas2[i].print();}
cout << endl;
cout << " In-place merge sort: " << endl;
cout << "char mas[] sort:" << endl;
char mas3[kol];
mas3[0] = 'x'; mas3[1] = 't'; mas3[2] = 'p'; mas3[3] = 'i'; mas3[4] = 'v'; mas3[5] = 'm'; mas3[6] = 'f'; mas3[7] = 'e';
strand(mas3, kol);
for (int i = 0; i < kol; i++)
cout << mas3[i] << " ";
cout << endl << endl;
cout << " In-place merge sort: " << endl;
cout << "int mas[] sort:" << endl;
int mas5[kol];
mas5[0] = 4; mas5[1] = 78; mas5[2] = 12; mas5[3] = 19; mas5[4] = 67; mas5[5] = 54; mas5[6] = 98; mas5[7] = 37;
strand(mas5, kol);
for (int i = 0; i < kol; i++)
cout << mas5[i] << " ";
cout << endl << endl;
cout << " In-place merge sort: " << endl;
cout << "double mas[] sort:" << endl;
double mas6[kol];
mas6[0] = 4.25; mas6[1] = 78.17; mas6[2] = 12.24; mas6[3] = 19.99; mas6[4] = 67.31; mas6[5] = 54.4; mas6[6] = 98.79; mas6[7] = 37.9;
strand(mas6, kol);
for (int i = 0; i < kol; i++){
cout << mas6[i] << " ";
}
cout << endl << endl;
return 0;
} |
|
Есть парочка ошибок:
1. node_t: класс шаблон уже объявлен как не класс шаблон
2. node_t: множественные списки параметров шаблон не допускаются
Как их исправить незнаю ни где ни как. Помогите пожалуйста и объясните почему нужно сделать так как вы сделали.
Добавлено через 12 часов 6 минут
UP!!!
Добавлено через 1 час 40 минут
UP!!!
0
|
(
