Kaja Fumei

Do you want where the whole column/vector is all 0 (what I thought you meant) or just a certain number of consecutive 0's in the column (like UnKnown X's algorithm)?

DaWei

Consider for a moment that your matrix, however implemented, may be addressed as matrix [r][c], where r is a row number and c is a column number. Address matrix [r][cDesiredColumn] for every r from rMin to rMax. If, at any point, you find a non-zero value, you do NOT have a column of zeroes; you're finished. If you reach the end without finding a non-zero element, you have a column of zeroes. Expand on that if you have further requirements or if your requirements weren't correctly expressed.

__________________
Abstraction doesn't make it impossible to write bad code; it makes it possible to write superior code.
Contributor's Corner: Grumpy on C++ Exceptions DaWei on Pointers