import java.util.ArrayList;
import java.util.Collections;

/**
*
* @author
*/
public class BEA_Algorithm {

public static void main(String[] args) {
   int[][] customer = {
         {80, 15, 50, 65, 65},
         {15, 60, 0, 45, 60},
         {50, 0, 50, 50, 10},
         {65, 45, 50, 95, 55},
         {65, 60, 10, 55, 70}
   };

   int[][] student = {
         {0, 0, 0, 0, 0},
         {0, 20, 5, 5, 5},
         {0, 5, 35, 35, 5},
         {0, 5, 35, 35, 5},
         {0, 5, 5, 5, 20}
   };

   int[][] ca = bea(customer);

   printTable(ca);

   System.out.println("----------------------");
   ca = bea(student);

   printTable(ca);

}

private static void printTable(int[][] ca) {
   for (int i = 0; i < ca.length; i++) {
         int[] is = ca[i];
         for (int j = 0; j < is.length; j++) {
            int k = is[j];
            System.out.print(k + " ");
         }
         System.out.println("");
   }
}

private static int[][] bea(int[][] aa) {
   int[][] ca = new int[aa.length][aa.length];

   //    {initialize; remember that AA is an n × n matrix }
   //CA(• , 1) ← AA(• , 1) ;
   //CA(• , 2) ← AA(• , 2) ;
   copyColumn(aa, ca, 0, 0);
   copyColumn(aa, ca, 1, 1);

   //index ← 3 ;
   int index = 2;

   while (index < aa.length) { // {choose the “best” location for attribute AAindex}
         // for i from 1 to index− 1 by 1 do calculate cont(Ai−1 , Aindex, Ai) ;

         ArrayList<Cont> conts = new ArrayList<>();
         for (int i = 0; i < index - 1; i++) {
            conts.add(cont(aa, i - 1, index, i));
         }
         conts.add(cont(aa, index - 1, index, index + 1));

         Collections.sort(conts);

Tables 8 tables minimum 250 records in the main (primary) table...