Dark Mode

24 views

0 votes

An $n \times n$ binary matrix $M$ is called a NICE matrix, if each row of $M$ has exactly one non-zero element and each column also has exactly one non-zero element.

- Suggest a method of storing a NICE matrix in an $O(n)$ size array.
- Design an $O(n)$ time algorithm (in pseudocode) for computing $R=P Q$, where $P$ and $Q$ are both NICE matrices each stored in an array of size $O(n)$ as in (i).