# Program to print elements of a Matrix row-wise skipping alternate elements

Given a matrix of N*N size where N is always odd, the task is to print elements of a matrix row-wise skipping alternate elements.

Examples:

Input: mat[3][3] =
{{1, 4, 3},
{2, 5, 6},
{7, 8, 9}}
Output: 1 3 5 7 9

Input: mat[5][5] =
{{1, 2, 3, 4, 9},
{5, 6, 7, 8, 44},
{19, 10, 11, 12, 33},
{13, 14, 15, 16, 55},
{77, 88, 99, 111, 444}}
Output: 1 3 9 6 8 19 11 33 14 16 77 99 444

## Recommended: Please try your approach on {IDE} first, before moving on to the solution.

Approach:

1. Start traversing the matrix.
2. For each row, check if the row number is even or odd.
• If the row is even, then print the elements at the even index of that row.
• If the row is odd, print the elements at the odd index of that row.

Below is the implementation of above approach:

## C++

 // C++ program to print elements of a Matrix  // row-wise skipping alternate elements #include using namespace std; #define R 100 #define C 100    // Function to print the alternate // elements of a matrix void printElements(int mat[][C], int n) {     for (int i = 0; i < n; i++) {         if (i % 2 == 0)             for (int j = 0; j < n; j += 2)                 cout << mat[i][j] << " ";         else             for (int j = 1; j < n; j += 2)                 cout << mat[i][j] << " ";     } }    // Driver code int main() {     int n = 3;     int mat[R][C] = { { 1, 5, 3 },                       { 2, 4, 7 },                       { 9, 8, 6 } };        printElements(mat, n);        return 0; }

## Java

 // Java Program to print elements of a Matrix // row-wise skipping alternate elements import java.util.*; import java.lang.*;    class GFG{ // Function to print the alternate // elements of a matrix static void printElements(int[][] mat, int n) {     for (int i = 0; i < n; i++)      {         if (i % 2 == 0)             for (int j = 0; j < n; j += 2)                 System.out.print(mat[i][j] + " ");         else             for (int j = 1; j < n; j += 2)                 System.out.print(mat[i][j] + " ");     } }    // Driver code public static void main(String args[]) {     int n = 3;     int[][] mat = new int[][]{ { 1, 5, 3 },{ 2, 4, 7 },{ 9, 8, 6 } };        printElements(mat, n); } }    // This code is contributed  // by Akanksha Rai(Abby_akku)

## Python3

 # Python 3 program to print elements of a Matrix # row-wise skipping alternate elements      # Function to print the alternate # elements of a matrix def printElements(mat, n) :        for i in range(n) :         if i % 2 == 0 :             for j in range(0, n, 2) :                 print(mat[i][j],end = " ")         else :             for j in range(1, n, 2) :                 print(mat[i][j],end =" ")                       # Driver Code if __name__ == "__main__" :        n = 3     mat = [ [ 1, 5, 3],             [ 2, 4, 7],             [ 9, 8, 6] ]        printElements(mat , n)       # This code is contributed by ANKITRAI1

## C#

 // C# Program to print elements  // of a Matrix row-wise skipping  // alternate elements using System;    class GFG { // Function to print the alternate // elements of a matrix static void printElements(int[,] mat,                            int n) {     for (int i = 0; i < n; i++)      {         if (i % 2 == 0)             for (int j = 0; j < n; j += 2)                 Console.Write(mat[i, j] + " ");         else             for (int j = 1; j < n; j += 2)                 Console.Write(mat[i, j] + " ");     } }    // Driver code public static void Main() {     int n = 3;     int[,] mat = new int[,]{ { 1, 5, 3 },                               { 2, 4, 7 },                              { 9, 8, 6 }};        printElements(mat, n); } }    // This code is contributed  // by ChitraNayal

## PHP



Output:

1 3 4 9 6

My Personal Notes arrow_drop_up

Discovering ways to develop a plane for soaring career goals

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.