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
|
#include <iostream>
#include <fstream>
#include <string>
#include <algorithm>
using namespace std;
ifstream infile;
struct nodeType
{
string data;
nodeType *next;
}
bool alphorder(nodeType*& head, nodeType*& current, nodeType*& after, nodeType*& before, nodeType*& tail, string name, nodeType *next, bool found)
{
infile.open("intext.txt");
infile >> name;
while (!infile.eof( ))
{
found = false;
while (!found)
{
if (head == NULL)
{
head = new nodeType;
head->data = name;
head->next = NULL;
before = head;
found = true;
}
else if ((name <= before->data) && (!found))
{
nodeType *temp = NULL;
temp = new nodeType;
temp->data = name;
temp->next = head;
head = temp;
found = true;
}
else if (((name > before->data) && (!found)) && (before->next == NULL))
{
current = new nodeType;
current->data = name;
before->next = current;
current->next = NULL;
found = true;
}
else if ((name > before->data) && (!found))
{
after = before->next;
if ((name > before->data) && (name< after->data))
{
current = new nodeType;
current->data = name;
current->next = after;
before->next = current;
found = true;
}
else
{
before = after;
after = before->next;
}
}
else if (((name > after->data) && (after->next != NULL)) && (!found))
{
before = after;
after = before->next;
}
else if (((name > after->data) && (after->next == NULL)) && (!found))
{
current = new nodeType;
current->data = name;
after->next = current;
current->next = NULL;
found = true;
}
}
infile >> name;
}
current = head;
while(current != NULL)
{
cout << current->data<<endl;
current = current->next;
}
infile.close();
}
int main()
{
nodeType *head = NULL, *current = NULL, *after = NULL, *before = NULL, *tail = NULL;
string name;
nodeType *next;
bool found;
alphorder(head, current, after, before,tail, name, next, found);
system ("pause");
return 0;
}
|
