-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy pathgraph.cpp
89 lines (77 loc) · 1.61 KB
/
graph.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
#include<iostream>
#include<cmath>
using namespace std;
double round(double number)
{
return number < 0.0 ? ceil(number - 0.5) : floor(number + 0.5);
}
static string axis = "+ ";
static string line = "# ";
static string graph = ". ";
int main() {
int size = 15;
double step = (1.0);
int *values = new int[size+size+1];
for(int i = 0;i< size+size+1;++i) {
double x = (i - (size));
x = x*step;
// EQUATION
double value = -x;
/// EQUATION
value = value/step;
values[i] = int(round(value));
}
// cout << "TABLE:" << endl;
// for(int i = 0; i < size+size+1;++i) {
// cout << (i - (size)) << " : " << values[i] << endl;
// }
for(int i = 0; i < size+size+1;++i) {
cout << endl;
}
for(int i = 0;i < size;++i) {
for(int b = 0; b < size;++b) {
if(size - i == values[b])
cout << line;
else
cout << graph;
}
if(size -i == values[size])
cout << line;
else
cout << axis;
for(int b = 0; b < size;++b) {
if(size - i == values[b+size+1])
cout << line;
else
cout << graph;
}
cout << endl;
}
for(int i = 0;i < size*2+1;++i) {
if( 0 == values[i] )
cout << line;
else
cout << axis;
}
cout << endl;
for(int i = 0;i < size;++i) {
for(int b = 0; b < size;++b) {
if(0-i-1 == values[b])
cout << line;
else
cout << graph;
}
if(0 -i-1 == values[size])
cout << line;
else
cout << axis;
for(int b = 0; b < size;++b) {
if(0-i-1 == values[b+size+1])
cout << line;
else
cout << graph;
}
cout << endl;
}
delete[] values;
}