Algorithmen_Datenstrukturen/Uebung 1/Sortiment.cpp

#include "Sortiment.h"

void Sortiment::addWare(Ware *ware) {
  for (int i = 0; i < 10; i++) {
    if (this->waren[i] == nullptr) {
      this->waren[i] = ware;
    }
  }
}