- Initialize two vectors a and b as a=[],b=[];
- Now add this line (a = [a count_zero];)at a line or end of loop from where you need to store the value of count_zero from.
- Do the same for b,(b = [b count_value];) .
- This will store all your values of count_zero in vector a and count_value in vector b.
- Below is the example for your reference.
Given a collection of points, return the indices of the rows that contain the two points most distant from one another. The input vector p has two columns corresponding to the x and y coordinates of each point. Return ix, the (sorted) pair of indices pointing to the remotest rows. There will always be one unique such pair of points.
So if
p = [0 0]
[1 0]
[2 2]
[0 1]
Then
ix = [1 3]
That is, the two points p(1,:) and p(3,:) are farthest apart.
%Then
% ix = [1 3]
%That is, the two points p(1,:) and p(3,:) are farthest apart.
function ix = mostDistant(p)
[len,~] = size(p);
dist = []; % vector I am storing distance for each combination of points
idx = []; % indices of points for which the distance is stored in vector dist
for i = 1: len
for j = 1:len
distance_between = (p(j,1)-p(i,1))^2 + (p(j,2)-p(i,2))^2;
distance_between;
dist = [dist; distance_between; distance_between]; % Appending the distance
idx = [idx ;i ;j]; % Appending the indices
end
end
mat = [dist idx];
h = sortrows(mat,1,"ascend");
[len2 ,~] = size(h);
iwx = [h(end-1,2) h(end,2)];
ix = sort(iwx);
end
