-
Notifications
You must be signed in to change notification settings - Fork 0
/
Order_List.cpp
118 lines (85 loc) · 2.15 KB
/
Order_List.cpp
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
#include <iostream>
#include <stdio.h>
using namespace std;
using namespace std;
class List
{
class Node
{
public:
float num;
Node *address=NULL;
public:
Node(float pnum)
{
num = pnum;
}
};
public:
//Real definition of List
static short Nodeamount;
private: Node *head = NULL;
public:
Node* getHead()
{
return head;
}
void setHead(Node* nod)
{
head = nod;
}
void addElement(float n)
{
Node *nod = new Node(n);
Nodeamount++;
if(head==NULL)
{
setHead(nod);
}else
{
if(head->num>=nod->num)
{
nod->address = head;
setHead(nod);
}else
{
Node *reader;
for(reader=head; reader->address!=NULL; reader=reader->address)
{
if(nod->num<=reader->address->num)
{
nod->address = reader->address;
reader->address = nod;
break;
}
}
if(reader->address==NULL)
{
reader->address = nod;
}
}
}
}
void printList()
{
Node *reader = head;
for(int i=0; i<Nodeamount; i++)
{
cout<<reader->num<<endl;
reader = reader->address;
}
}
};
short List::Nodeamount = 0;
int main()
{
List A;
float r[] = {2.1,6.3,7.3,8.1,0.2,7.4};
for(int i=0; i<6; i++)
{
A.addElement(r[i]);
A.printList();
cout<<"-------------------------------"<<endl;
}
return 0;
}