-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathConsoleApplication1.cpp
More file actions
376 lines (341 loc) · 6.83 KB
/
ConsoleApplication1.cpp
File metadata and controls
376 lines (341 loc) · 6.83 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
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
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
#include <iostream>
#include <conio.h>
#include <cmath>
#include<ctime>
//#include<locale.h>
using namespace std;
struct MyList
{
int data; //èíôîðìàöèîííîå ïîëå
MyList* next; //óêàçàòåëü íà ñëåäóþùèé ýëåìåíò
MyList* prev; //óêàçàòåëü íà ïðåäûäóùèé ýëåìåíò
};
MyList* head;
int* my_shaker(MyList* head);
void print_list();
int find_node(const int searched);
void del_node(const int el_for_remove);
void add_list(const int size, const int fill_in_type);
void add_node();
void output_array(int* my_array, const int size);
int* sort_Sheiker(int* my_array, const int size);
int do_input();
void counting(int* my_array, const int size);
int main()
{
bool stopper = false;
while (!stopper)
{
int size = 0;
int i = 0;
setlocale(LC_ALL, "Russsian");
system("chcp 1251");
cout << "\nâûáåðèòå æåëàåìîå äåéñòâèå:\n1.ïîèñê ýëåìåíòà\n2.ñîçäàòü ñïèñîê\n3.äîáàâèòü ýëåìåíò\n4.óäàëèòü ýëåìåíò\n5.ñîðòèðîâêà ñïèñêà\n6.âûâîä ñïèñêà\n0.äëÿ çàâåðøåíèÿ\n";
int x = 0;
while (x < 48 || x>54)
{
x = _getch();
if (x < 48 || x>54)
{
cout << "\nââåäåíî íåêîððåêòíîå çíà÷åíèå, ââåäèòå êîððåêòíîå\n";
}
}
switch (x)
{
case 49://ïîèñê ýëåìåíòà
{
cout << "\nââåäèòå çíà÷åíèå äëÿ ïîèñêà\n";
int x = do_input();
int unique=find_node(x);
if (unique != 0)
{
cout << "\näà, òàêîå çíà÷åíèå åñòü â ñïèñêå, âñòðå÷àåòñÿ îíî "<<unique<<" ðàç\n";
}
else
{
cout << endl << "\nèñêîìîå çíà÷åíèå â ñïèñêå íå âñòðå÷àåòñÿ\n";
}
break;
}
case 50://ñîçäàòü ñïèñîê
{
int size = 0;
do
{
cout << "\nââåäèòå æåëàåìûé ðàçìåð ñïèñêà:\n";
size=do_input();
if (size < 1)
{
cout << "\nââåäåíî íåêîððåêòíîå çíà÷åíèå, ïîïðîáóéòå åùå ðàç\n";
}
} while (size<1);
int fill_in_type=0;
do
{
cout << "\nâûáåðèòå âàðèàíò çàïîëíåíèÿ ñïèñêà\n1.çàïîëíåíèå â àâòîìàòè÷åñêîì ðåæèìå\n2.çàïîëíåíèå ñ ðó÷íûì óêàçàíèåì ýëåìåíòîâ\n";
fill_in_type = _getch();
if (fill_in_type < 49 || fill_in_type>50)
{
cout << "\nââåäåíî íåêîððåêòíîå çíà÷åíèå, ââåäèòå êîððåêòíîå\n";
}
} while (fill_in_type < 49 || fill_in_type>50);
add_list(size,fill_in_type);
break;
}
case 51://äîáàâèòü ýëåìåíò
{
cout << "\nââåäèòå æåëàåìîå çíà÷åíèå\n";
//int temp = do_input();
add_node();
break;
}
case 52://óäàëèòü ýëåìåíò
{
cout << "\nââåäèòå óäàëÿåìîå çíà÷åíèå\n";
int x = do_input();
del_node(x);
break;
}
case 53://ñîðòèðîâêà ñïèñêà
{
int* temp = new int[2];
temp[0] = 0;
temp[1] = 0;
temp = my_shaker(head);
cout << "\nêîëè÷åñòâî ñðàâíåíèé = " << temp[0] << endl;
cout << "\nêîëè÷åñòâî ïåðåñòàíîâîê = " << temp[1] << endl;
break;
}
case 54://âûâîä ñïèñêà
{
print_list();
break;
}
case 48:
{
stopper = true;
break;
}
default:
break;
}
}
return 0;
}
void add_list(const int size,const int fill_in_type)
{
if (fill_in_type == 50)
{
cout << "ââîäèòå ýëåìåíòû ïî îäíîìó\n";
}
srand(time(0));
for (int position = 1; position <= size; position++)
{
if (fill_in_type == 50)
{
add_node();
}
else if (fill_in_type == 49)
{
int value = 1 + rand() % size;
MyList* Node = new MyList; //ñîçäàíèå íîâîãî ýëåìåíòà
Node->data = value; //ïðèñâîåíèå ýëåìåíòó çíà÷åíèÿ
if (head == NULL) //åñëè ñïèñîê ïóñò
{
Node->next = Node; //óñòàíîâêà óêàçàòåëÿ next
Node->prev = Node; //óñòàíîâêà óêàçàòåëÿ prev
head = Node; //îïðåäåëÿåòñÿ ãîëîâà ñïèñêà
}
else
{
MyList* p = head;
p = p->prev;
p->next->prev = Node;
Node->next = p->next;
Node->prev = p;
p->next = Node;
}
}
else
{
cerr << "\níåêîððåêòíûå âõîäíûå äàííûå äëÿ ôóíêöèè\n";
}
}
}
void add_node()
{
int value = do_input();
MyList* Node = new MyList; //ñîçäàíèå íîâîãî ýëåìåíòà
Node->data = value; //ïðèñâîåíèå ýëåìåíòó çíà÷åíèÿ
if (head == NULL) //åñëè ñïèñîê ïóñò
{
Node->next = Node; //óñòàíîâêà óêàçàòåëÿ next
Node->prev = Node; //óñòàíîâêà óêàçàòåëÿ prev
head = Node; //îïðåäåëÿåòñÿ ãîëîâà ñïèñêà
}
else
{
MyList* p = head;
p = p->prev;
p->next->prev = Node;
Node->next = p->next;
Node->prev = p;
p->next = Node;
}
}
void print_list()
{
int unique = 0;
if (head == NULL)
{
cout << "\nÑïèñîê ïóñò\n\n";
}
else
{
MyList* temp = head;
cout << "\nÝëåìåíòû ñïèñêà: ";
do
{
cout << temp->data << " ";
temp = temp->next;
if (find_node(temp->data) == 1)
{
unique++;
}
} while (temp != head);
cout << "\nêîëè÷åñòâî óíèêàëüíûõ ýëåìåíòîâ â ñïèñêå = "<<unique<<"\n";
}
}
int find_node(const int searched)
{
if (head == NULL)
{
cout << "\nÑïèñîê ïóñò\n\n";
return 0;
}
else
{
int x = 0;
MyList* temp = head;
do
{
if (temp->data == searched)
{
x++;
}
temp = temp->next;
} while (temp != head);
//cout << "\n÷èñëî íàéäåíî " << x << " ðàç\n";
return x;
}
}
void del_node(const int el_for_remove)
{
if (head == NULL)
{
cout << "\nÑïèñîê ïóñò\n\n";
}
else
{
if (head->data == el_for_remove)
{
head = head->next;
}
int x = 0;
MyList* temp = head;
do
{
if (temp->data == el_for_remove)
{
x++;
temp->prev->next = temp->next;
temp->next->prev = temp->prev;
}
temp = temp->next;
} while (temp != head);
if (x != 0)
{
cout << "\näà, òàêîå çíà÷åíèå åñòü â ñïèñêå, óäàëåíî îíî " << x << " ðàç\n";
}
else
{
cout << endl << "èñêîìîå çíà÷åíèå â ñïèñêå íå âñòðå÷àåòñÿ";
}
}
}
int do_input()
{
int temp = 0;
cin >> temp;
while (!cin.good()) //Êîíòðîëü êîððåêòíîñòè ââîäèìûõ çíà÷åíèé
{
cin.clear();
cin.ignore();
cerr << endl << "Ââåäåíî íåêîððåêòíîå çíà÷åíèå, ââåäèòå êîððåêòíîå" << endl;
cout << endl << "ââåäèòå çíà÷åíèå ";
cin >> temp;
}
return temp;
}
int* my_shaker(MyList* head)
{
int* iter = new int[2];
iter[0] = 0;
iter[1] = 0;
bool stop = false;
if (head == NULL)
{
cout << "\nÑïèñîê ïóñò\n\n";
}
else if (head == head->next)
{
cout << "\nâ ñïèñêå âñåãî 1 ýëåìåíò\n";
}
else
{
int amount_elements = 0;
MyList* temp = head;
MyList* leftstop = head;
MyList* rightstop = head->prev;
do
{
temp = temp->next;
amount_elements++;
} while (temp != head);
temp = head;
int iteration = 0;
do//öèêë îáùåé ñîðòèðîâêè
{
iteration++;
do//öèêë âïðàâî, óâåëè÷åíèå
{
if (temp->next->data > temp->data)
{
int buff = temp->next->data;
temp->next->data = temp->data;
temp->data = buff;
iter[1]++;
}
temp = temp->next;
iter[0]++;
} while (temp != rightstop);
rightstop = temp->prev;
temp = rightstop;
while (temp != leftstop)//öèêë âëåâî,óìåíüøåíèå
{
if (temp->prev->data < temp->data)
{
int buff = temp->prev->data;
temp->prev->data = temp->data;
temp->data = buff;
iter[1]++;
}
temp = temp->prev;
iter[0]++;
}
leftstop = temp->next;
temp = leftstop;
} while (iteration< amount_elements/2);
}
return iter;
}