Algorithmen_Datenstrukturen/Uebung 1/Algorithms.h

#pragma once
#include "Sortiment.h"
#include <algorithm>

void bubbleSort(Ware *waren[10]) {
  for (int i = 0; i < 10; i++) {
    if (waren[i] > waren[i + 1]) {
      std::swap(waren[i], waren[i + 1]);
    }
  }
}