Sigrid Benezra - Edges - Matrix conver to zero

[sdbenezra]

With the assumption that n represents the number of rows, and m represents the number of columns, the time complexity is O(n x m) because my program nests iteration over columns and rows. And although I run through a nested loop three times in the program, dropping coefficients means the equation boils down to O(n x m).

The space complexity is O(m) due to the use of an array to keep track of the columns in which a zero is found when iterating over a row, and in the worst case where every element is a 0 in a row, the array length would match the number of columns.