% time get_perm() using x98

  K_max = 7;

  t_perm = zeros(K_max-1,1);

  trials = 100;

for K = 2:K_max

  K

  x98;

  [p q] = get_perm( L, 0, 0, 1, 1, 2, 1); % toss one

  tic
  for i=1:trials
    [p q] = get_perm( L, 0, 0, 1, 1, 2, 1);
    [p ip] = sort(p);
  end
  t = M*(toc/trials)

  t_perm(K-1) = t;

end

% get_perm( L, zz, vp, cur, next, col, el) - find lowest cost permutation
