An n-by-n square logical matrix can be represented by a cell vector of n elements where the kth element corresponds to the kth row of the matrix. Each element of the cell vector is a row vector of positive integers in increasing order representing the column indexes of the logical true values in the given row of the matrix. All other elements in the given row of the logical matrix are false. Write a function called logiunpack that takes such a cell vector as its only input and returns the corresponding square logical matrix. For example, such a cell vector representation of a 100-by-100 logical matrix with the only true elements at indexes (10,20) and (10,75) would have only one non-empty element of the cell vector at index 10. That element is the vector [20 75].
Solve the inverse of the previous problem. That is, write a function called logipack that takes a square logical matrix as its only input argument and returns its cell vector representation as specified in the previous assignment. Note that empty array elements of the cell vector corresponding to rows with all false values must have a size of 0x0.
function Out=logipack(M)
[row,col]=size(M);
Out=cell(1,length(M));
for i=1:row
for j=1:col
if (sum((M(i,:)==0)))==0
return
elseif M(i,j)==1
Out{i}=j;
end
end
end
end
Problem 6 (logipack):
Feedback: Your function performed correctly for argument(s) [0 1;1 0]
Feedback: Your function made an error for argument(s) [1 0 0;1 1 1;0 0 0]
Your solution is _not_ correct.
