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
|
#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
struct Point
{
int x;
int y;
Point() : Point(0,0){}
Point(int x, int y)
{
this->x = x;
this->y = y;
}
double getDistance(const Point& other) const
{
int dx = x - other.x;
int dy = y - other.y;
return sqrt(dx * dx + dy * dy);
}
};
void print(const Point& p)
{
std::cout << "[ x: " << p.x << ", y: " << p.y <<" ]";
}
struct Rectangle
{
private:
Point points[4];
public:
Rectangle() = default; //the same as Rectangle() {}
void setPoint(size_t index, int x, int y)
{
if(index > 3)
return;
points[index].x = x;
points[index].y = y;
}
const Point& getPoint(size_t index) const
{
if(index > 3)
return {}; //some Error. This is a refference to a temporary memory, so a better solution would be to throw an exception.
return points[index];
}
double getPer() const
{
return 2 * points[0].getDistance(points[1]) + 2 * points[1].getDistance(points[2]);
}
};
void print(const Rectangle& rect)
{
for(int i = 0; i < 4; i++)
{
print(rect.getPoint(i));
}
}
void swap(Rectangle& tr1, Rectangle& tr2)
{
Rectangle temp = tr1;
tr1 = tr2;
tr2 = temp;
}
void selectionSort(Rectangle* triangles, double* perimeters, unsigned size)
{
for (unsigned i = 0; i < size - 1; i++)
{
//findMin
int minElementIndex = i;
for (unsigned j = i + 1; j < size; j++)
{
if (perimeters[j] < perimeters[minElementIndex])
minElementIndex = j;
}
if (minElementIndex != i)
{
swap(perimeters[i], perimeters[minElementIndex]);
swap(triangles[i], triangles[minElementIndex]);
}
}
}
int main()
{
ifstream file("rects.txt");
if(!file.is_open())
{
std::cout << "Error while opening the file!";
return -1;
}
int n;
file >> n;
Rectangle* rects = new Rectangle[n];
double* perimeters = new double[n]; //this should be size_t, but we are using a double returning function for getDist.
for(size_t i = 0; i < n; i++)
{
int x1, y1, x3, y3;
file >> x1 >> y1 >> x3 >> y3;
rects[i].setPoint(0, x1, y1);
rects[i].setPoint(1, x1, y3);
rects[i].setPoint(2, x3, y3);
rects[i].setPoint(3, x3, y1);
perimeters[i] = rects[i].getPer();
}
selectionSort(rects, perimeters, n); //selection sort, because we want min number of copies (or swaps)
for(size_t i = 0; i < n; i++)
{
print(rects[i]);
std::cout <<", Per: " << perimeters[i] << std::endl;
}
delete[] rects, perimeters;
return 0;
}
|
