-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathvector.cpp
112 lines (91 loc) · 2.18 KB
/
vector.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
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <stdlib.h>
#include <sstream>
#include "employee.h"
using namespace std;
void swap(vector<employee> employees, int a, int b);
void sortEmployees(vector<employee> &employees);
void printEmployees(vector<employee> &employees);
void loadEmployees(vector<employee> &employees, const char *file);
int main(int argc, char *argv[])
{
vector<employee> employees;
if (argc == 2)
{
loadEmployees(employees, argv[1]);
printEmployees(employees);
//sortEmployees(employees);
//printEmployees(employees);
}
else
{
cout << "Syntax : " << argv[0] << " employeefile\n";
}
return 0;
}
void loadEmployees(vector<employee> &employees, const char *file)
{
ifstream fin;
employee emp;
string line;
fin.open(file);
if (!fin)
{
cout << "Unable to read from " << file << "\n";
exit(0);
}
while(getline(fin, line))
{
stringstream linestream(line);
string data;
string surname;
double hourlyRate;
int empNumber;
linestream >> surname >> hourlyRate >> empNumber;
emp.setEmployee(surname, hourlyRate, empNumber);
employees.push_back(emp);
}
fin.close();
}
void printEmployees(vector<employee> &employees)
{
unsigned int i;
for (i=0; i<employees.size(); i++)
{
employees[i].printEmployee();
}
cout << "\n";
}
void swap(vector<employee> employees, int a, int b)
{
employee temp(employees[a]);
employees[a] = employees[b];
employees[b] = temp;
}
void sortEmployees(vector<employee> &employees)
{
/* use selection sort to order employees,
in employee name order
*/
int number = employees.size();
int inner, outer, max;
for (outer=number-1; outer>0; outer--)
{
// run though array number of times
max = 0;
for (inner=1; inner<=outer; inner++)
{
// find alphabetically largest surname
if (employees[inner].getSurname() > employees[max].getSurname())
max = inner;
}
if (max != outer)
{
// swap largest with last element in array
swap(employees, max, outer);
}
}
}