Falkenlowe_Number-One/Bingo/Bingo_Plade/Bingo_Plade.pde
 int[] colonne = new int[3];
int[][] bankoPlade = new int[9][3];

void setup() {
  
  colonne = tilfaeldigeTal(colonne.length); //<>//
  colonne = sorter(colonne);
  
  while(findEns(colonne)){
  colonne=tilfaeldigeTal(colonne.length);
  colonne = sorter(colonne);

}
  printArray(colonne);
}

void draw() {
}


int[] tilfaeldigeTal(int antal) {
  int[] col = new int[antal];  
  for (int i =0; i<antal; i++) {
    col[i] = (int)random(1, 11);
  }
  return col;
}

int[] sorter(int[] tal) {
  int i=0;
  //for (int i =0; i <tal.length-1; i++) {
  while (i<tal.length-1) {
    if (tal[i]>tal[i+1]) {
      int temp = tal[i];
      tal[i]=tal[i+1];
      tal[i+1]=temp;
      i=0;
    } else {
      i++;
    }
  }
  return tal;
}

boolean findEns(int[] tal) {
  boolean notAlike = false;
  // find og ret dubletter 
  for (int i =0; i<tal.length-1; i++) {
    
      if (tal[i] == tal[i+1]) {
        notAlike = true;
      }
    
  }
  return notAlike;
}
