-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathmain.cpp
More file actions
123 lines (107 loc) · 3.45 KB
/
Copy pathmain.cpp
File metadata and controls
123 lines (107 loc) · 3.45 KB
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
#include <iostream>
#include <fstream>
#include <string>
#include <sstream>
#include <vector>
#include <iomanip>
using namespace std;
int counter;
float step = 0.5;
double resultUnderestimate, resultOverestimate, resultTrapezoid, resultSimpson;
struct DataStruct{
float x;
float y;
};
vector <DataStruct> dataStruct;
DataStruct dataPoint;
bool loadData(){
string text;
fstream file;
stringstream buffer;
file.open("test.txt", ios::in);
while(!file.eof()){
file >> text; buffer << text; buffer >> dataPoint.x;
buffer.str("");
buffer.clear();
file >> text; buffer << text; buffer >> dataPoint.y;
buffer.str("");
buffer.clear();
counter++;
dataStruct.push_back(dataPoint);
}
return true;
}
double calculateUnderestimate(){
resultUnderestimate = 0;
for(int i = 0; i < counter - 1; i++)
resultUnderestimate += dataStruct[i].y;
return (step * resultUnderestimate);
}
double calculateOverestimate(){
resultOverestimate = 0;
for(int i = 1; i < counter; i++)
resultOverestimate += dataStruct[i].y;
return (step * resultOverestimate);
}
double trapezoidMethod(){
resultTrapezoid = 0;
for(int i = 1; i < counter - 1; i++)
resultTrapezoid += dataStruct[i].y;
return ((step*(((dataStruct[0].y + dataStruct[counter-1].y) / 2) + resultTrapezoid)));
}
double simpsonMethod(){
resultSimpson = 0;
for(int i = 1 ; i < counter - 1; i++){
if(i % 2 == 0) {
resultSimpson += (dataStruct[i].y * 2);
} else {
resultSimpson += (dataStruct[i].y * 4);
}
}
return (step / 3 * (dataStruct[0].y + dataStruct[counter-1].y + resultSimpson));
}
int main(int argc, const char * argv[]) {
if (loadData()== false){
cout << "Error loading dataStruct, check path." <<endl;
exit(0);
}
double underestimateResult = calculateUnderestimate();
double overestimateResult = calculateOverestimate();
double trapezoidResult = trapezoidMethod();
double simpsonResult = simpsonMethod();
int choice;
for(;;){
cout << "MAIN MENU" << endl;
cout << "--------------------------------------"<<endl;
cout << "1 - Rectangle method with underestimate"<< endl;
cout << "2 - Rectangle method with overestimate"<< endl;
cout << "3 - Trapezoid method"<< endl;
cout << "4 - Simpson's method"<< endl;
cout << "5 - End program"<< endl;
cout << endl;
cout << "Choose calculation method: ";
cin >> choice;
switch(choice){
case 1:
cout << "Result: " << underestimateResult <<endl;
break;
case 2:
cout << "Result: " << overestimateResult <<endl;
break;
case 3:
cout << "Result: " << trapezoidResult <<endl;
break;
case 4:
cout << "Result: " << simpsonResult <<endl;
break;
case 5:
cout << "End of program";
exit(0);
break;
default: cout << "No such option." << endl;
}
getchar();
system("clear");
}
return 0;
}