soberhofer
/
Algorithmen_Datenstrukturen
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

better test data

This commit is contained in:
Samuel Oberhofer 2022-05-26 10:07:23 +02:00
parent 156f65ae1d
commit 9b5f558b37
1 changed files with 10 additions and 10 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

20
Uebung 1/main.cpp
View File

@ -6,18 +6,18 @@ int main() {
Sortiment sortiment;
sortiment.addWare(new Ware("ware1", 1, 13.5, 10, 20));
sortiment.addWare(new Ware("ware1", 4, 14.6, 15, 20));
sortiment.addWare(new Ware("ware1", 5, 2.1, 13, 10));
sortiment.addWare(new Ware("ware1", 6, 6.5, 10, 20));
sortiment.addWare(new Ware("ware1", 7, 22.6, 15, 20));
sortiment.addWare(new Ware("ware1", 5, 15.1, 13, 10));
sortiment.addWare(new Ware("ware1", 8, 13.5, 10, 20));
sortiment.addWare(new Ware("ware1", 9, 13.6, 15, 20));
sortiment.addWare(new Ware("ware1", 2, 13.1, 13, 10));
sortiment.addWare(new Ware("a", 1, 13.5, 10, 20));
sortiment.addWare(new Ware("b", 4, 14.6, 15, 20));
sortiment.addWare(new Ware("k", 5, 2.1, 13, 10));
sortiment.addWare(new Ware("n", 6, 6.5, 10, 20));
sortiment.addWare(new Ware("h", 7, 22.6, 15, 20));
sortiment.addWare(new Ware("y", 5, 15.1, 13, 10));
sortiment.addWare(new Ware("n", 8, 13.5, 10, 20));
sortiment.addWare(new Ware("o", 9, 13.6, 15, 20));
sortiment.addWare(new Ware("aa", 2, 13.1, 13, 10));
sortiment.addWare(new Ware("ware1", 5, 13.1, 13, 10));
sortiment.sort(1);
sortiment.sort(3);
for (int i = 0; i < 10; i++) {
std::cout << *(sortiment.waren[i]) << std::endl;