Given a m x n 2D matrix, check if it is a Markov Matrix.
Markov Matrix : The matrix in which the sum of each row is equal to 1.
Example of Markov Matrix
Examples:
Input : 1 0 0 0.5 0 0.5 0 0 1 Output : yes Explanation : Sum of each row results to 1, therefore it is a Markov Matrix. Input : 1 0 0 0 0 2 1 0 0 Output : no
Approach: Initialize a 2D array, then take another single dimensional array to store the sum of each rows of the matrix, and check whether all the sum stored in this 1D array is equal to 1, if yes then it is Markov matrix else not.
Javascript
<script>// Javascript code to check Markov Matrixlet n = 3function checkMarkov( m){ // outer loop to access rows // and inner to access columns for (let i = 0; i <n; i++) { // Find sum of current row let sum = 0; for (let j = 0; j < n; j++) sum = sum + m[i][j]; if (sum != 1) return false; } return true;} // driver code // Matrix to check let m = [ [ 0, 0, 1 ], [ 0.5, 0, 0.5 ], [ 1, 0, 0 ] ]; // calls the function check() if (checkMarkov(m)) document.write(" yes "); else document.write(" no "); </script> |
Output :
yes
Time Complexity: O(m*n), Here m is the number of rows and n is the number of columns.
Auxiliary Space: O(1), As constant extra space is used.
Please refer complete article on Program for Markov matrix for more details!
Feeling lost in the world of random DSA topics, wasting time without progress? It’s time for a change! Join our DSA course, where we’ll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 neveropen!
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 neveropen!
