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

demo main

This commit is contained in:
Samuel Oberhofer 2022-05-23 21:52:08 +02:00
parent 895a846025
commit c7d6bdd372
1 changed files with 23 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

24
Uebung 1/main.cpp
View File

@ -1,3 +1,25 @@
#include "Sortiment.h" #include "Sortiment.h"
#include "Ware.h"
#include <iostream>
int main() { return 0; } int main() {
Sortiment sortiment;
sortiment.addWare(new Ware("ware1", 2, 13.5, 10, 20));
sortiment.addWare(new Ware("ware1", 7, 14.6, 15, 20));
sortiment.addWare(new Ware("ware1", 5, 2.1, 13, 10));
sortiment.addWare(new Ware("ware1", 2, 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", 2, 13.5, 10, 20));
sortiment.addWare(new Ware("ware1", 7, 13.6, 15, 20));
sortiment.addWare(new Ware("ware1", 5, 13.1, 13, 10));
sortiment.addWare(new Ware("ware1", 5, 13.1, 13, 10));
sortiment.sort(2);
for (int i = 0; i < 10; i++) {
std::cout << sortiment.waren[i]->getGewicht() << std::endl;
}
}