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
| #include<iostream>
#include<iomanip>
using namespace std;
void HeadToTail(int t, int info[], int pt1[]);
void AddToList(int x, int n, int v1, int t, int info[], int pt1[]);
void Sort(int n, int v1, int t, int info[], int pt1[]);
void AddThreeAfterThree(int n, int t, int info[], int pt1[]);
int main()
{
const int n = 15;
int info[n] = { 11, 15, 66, 45, 86, 98, 123, 44, 21, 97 };
int pt1[n] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, -1 };
int v1 = 0; //head
int x = 5555;//key
int t; //tail
t = v1;
AddToList(x, n, v1, t, info, pt1);
HeadToTail(t, info, pt1);
cout << endl;
t = v1;
AddThreeAfterThree(n, t, info, pt1);
Sort(n, v1, t, info, pt1);
HeadToTail(t, info, pt1);
system("pause");
return 0;
}
void AddToList(int x, int n, int v1, int t, int info[], int pt1[]){
cout << "The key is set to: " << x << endl;
for(int i = 0; i < n; i++){
if(info[i] == x){//Add next after key
info[n + 1] = 9999;
pt1[n + 1] = pt1[i];
pt1[i] = n + 1;
}
}
//Если ключ не найден, то добавить в начало списка
info[n - 5] = 5555;
pt1[n - 5] = v1;
v1 = n - 5;
}
void Sort(int n, int v1, int t, int info[], int pt1[]){
int temp = 0;
for (int i = 0; i < n; i++){
for (int j = i; j < n; j++){
if (info[i] > info[j]){
temp = info[i];
info[i] = info[j];
info[j] = temp;
}
}
}
}
void AddThreeAfterThree(int n, int t, int info[], int pt1[]){
cout << "Adding three elements after 3rd element:" << endl;
info[n - 1] = 1111;
pt1[n - 1] = pt1[2];
pt1[2] = n - 1;
info[n - 2] = 2222;
pt1[n - 2] = pt1[n - 1];
pt1[n - 1] = n - 2;
info[n - 3] = 3333;
pt1[n - 3] = pt1[n - 2];
pt1[n - 2] = n - 3;
HeadToTail(t, info, pt1);
cout << endl;
cout << endl;
}
void HeadToTail(int t, int info[], int pt1[])
{
while ((t != -1))
{
cout << info[t] << " " << pt1[t] << " " << t << endl;
t = pt1[t];
}
} |
(
