function [output,distance] = greedyTour(position,n);
m = size(position,1);
output = zeros(m,2);
tmp = position;
tmp(n,:) = [];
output(1,1) = position(n,1);
output(1,2) = position(n,2);
distance = 0;
for i = 2:m
max = 10000000;
mark = 0;
for j = 1:size(tmp,1)
d = sqrt((tmp(j,1)-output(i-1,1))^2+(tmp(j,2)-output(i-1,2))^2);
if(d<max)
max = d;
mark = j;
end
end
distance = distance+max;
output(i,1)=tmp(mark,1);
output(i,2)=tmp(mark,2);
tmp(mark,:)=[];
end