I have a matrix of logicals (TRUE, FALSE) and I need to count the number of rows that contain only TRUE values.My current algorithm:For every row:initialize counterreduce each col by + (take the sum of all the values in that row)if the result from 1. == the number of total columns, increment counter.Is there a different (hopefully more efficient) routine I could apply?
Better Algorithm to determine the number of all TRUE rows in a logical matrix
algorithms;performance