Print Matrix in snake Pattern Python

PROGRAM TO PRINT MATRIX IN SNAKE PATTERN



M = 4
N = 4
  
def printf(mat):
    global M, N
      
    # Traverse through all rows
    for i in range(M):
          
        # If current row is
        # even, print from
        # left to right
        if i % 2 == 0:
            for j in range(N):
                print(str(mat[i][j]),
                          end = " ")
  
        # If current row is 
        # odd, print from
        # right to left
        else:
            for j in range(N - 1, -1, -1):
                print(str(mat[i][j]), 
                          end = " ")
  
# Driver code
mat = [[ 10, 20, 30, 40 ],
       [ 15, 25, 35, 45 ],
       [ 27, 29, 37, 48 ],
       [ 32, 33, 39, 50 ]]
  
printf(mat)


OUTPUT
10 20 30 40 45 35 25 15 27 29 37 48 50 39 33 32

Comments

Post a Comment

Popular posts from this blog

Find first non-repeating character Python

PROGRAM TO FIND FIRST NON-REPEATING CHARACTER IN A STRING IN ONE TRAVERSAL NO_OF_CHARS = 256     # Returns an array of size 256 containg count # of characters in the passed char array def getCharCountArray(string):      count = [ 0 ] * NO_OF_CHARS      for i in string:          count[ ord (i)] + = 1      return count     # The function returns index of first non-repeating # character in a string. If all characters are repeating # then returns -1 def firstNonRepeating(string):      count = getCharCountArray(string)      index = - 1      k = 0          for i in string:          if count[ ord (i)] = = 1 :              index = k       ...
Read more

Find Duplicates Java

PROGRAM TO FIND REPEATING NUMBERS IN AN ARRAY class MAIN {           public static void main(String args[]) {          int numRay[] = { 0 , 4 , 3 , 2 , 7 , 8 , 2 , 3 , 1 };               for ( int i = 0 ; i < numRay.length; i++) {              numRay[numRay[i] %  numRay.length] = numRay[numRay[i] %  numRay.length] + numRay.length;          }          System.out.println( "The repeating elements are : " );          for ( int i = 0 ; i < numRay.length; i++) {              if (numRay[i] >= numRay.length* 2 ) {                ...
Read more

Special Keyboard Java

PROGRAM TO PRINT MAXIMUM NUMBER OF A'S USING GIVEN FOUR KEYS import java.io.*;   class GFG {        // A recursive function that returns      // the optimal length string  for N keystrokes      static int findoptimal( int N)      {          // The optimal string length is N          // when N is smaller than 7          if (N <= 6 )              return N;            // Initialize result          int max = 0 ;            // TRY ALL POSSIBLE BREAK-POINTS          // For any keystroke N, we need to        ...
Read more