# Row-wise vs column-wise traversal of matrix

Two common ways of traversing a matrix are row-major-order and column-major-order.
Row Major Order : When matrix is accessed row by row.
Column Major Order : When matrix is accessed column by column.

Examples:

```Input : mat[][] = {{1, 2, 3},
{4, 5, 6},
{7, 8, 9}}
Output : Row-wise: 1 2 3 4 5 6 7 8 9
Col-wise : 1 4 7 2 5 8 3 6 9
```

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

Difference: If we see according to time complexity, both lead to O(n2), but when it comes to cache level one of the orders access will be faster as compare to other one. It depends on the language we are using. Like in C, store matrix in row major form so while accessing the i+1th element after ith, most probably it will lead to a hit, which will further reduce the time of program.
Following codes are showing the time difference in row major and column major access.

 `// C program showing time difference ` `// in row major and column major access ` `#include ` `#include ` ` `  `// taking MAX 10000 so that time difference ` `// can be shown ` `#define MAX 10000 ` ` `  `int` `arr[MAX][MAX] = {0}; ` ` `  `void` `rowMajor() { ` ` `  `  ``int` `i, j; ` ` `  `  ``// accessing element row wise ` `  ``for` `(i = 0; i < MAX; i++) { ` `    ``for` `(j = 0; j < MAX; j++) { ` `      ``arr[i][j]++; ` `    ``} ` `  ``} ` `} ` ` `  `void` `colMajor() { ` ` `  `  ``int` `i, j; ` ` `  `  ``// accessing element column wise ` `  ``for` `(i = 0; i < MAX; i++) { ` `    ``for` `(j = 0; j < MAX; j++) { ` `      ``arr[j][i]++; ` `    ``} ` `  ``} ` `} ` ` `  `// driver code ` `int` `main() { ` `  ``int` `i, j; ` ` `  `  ``// Time taken by row major order ` `  ``clock_t` `t = ``clock``(); ` `  ``rowMajor(); ` `  ``t = ``clock``() - t; ` `  ``printf``(``"Row major access time :%f s\n"``,  ` `                ``t / (``float``)CLOCKS_PER_SEC); ` ` `  `  ``// Time taken by column major order ` `  ``t = ``clock``(); ` `  ``colMajor(); ` `  ``t = ``clock``() - t; ` `  ``printf``(``"Column major access time :%f s\n"``,  ` `               ``t / (``float``)CLOCKS_PER_SEC); ` `  ``return` `0; ` `} `

 `// Java program showing time difference ` `// in row major and column major access ` `import` `java.time.Duration; ` `import` `java.time.Instant; ` `import` `java.util.*; ` ` `  `class` `GFG  ` `{ ` ` `  `// taking MAX 10000 so that time difference ` `// can be shown ` `static` `int` `MAX= ``10000``; ` ` `  `static` `int` `[][]arr = ``new` `int``[MAX][MAX]; ` ` `  `static` `void` `rowMajor()  ` `{ ` ` `  `    ``int` `i, j; ` `     `  `    ``// accessing element row wise ` `    ``for` `(i = ``0``; i < MAX; i++)  ` `    ``{ ` `        ``for` `(j = ``0``; j < MAX; j++)  ` `        ``{ ` `        ``arr[i][j]++; ` `        ``} ` `    ``} ` `} ` ` `  `static` `void` `colMajor()  ` `{ ` ` `  `    ``int` `i, j; ` `     `  `    ``// accessing element column wise ` `    ``for` `(i = ``0``; i < MAX; i++)  ` `    ``{ ` `        ``for` `(j = ``0``; j < MAX; j++) ` `        ``{ ` `        ``arr[j][i]++; ` `        ``} ` `    ``} ` `} ` ` `  `// Driver code ` `public` `static` `void` `main(String[] args)  ` `{ ` ` `  `    ``// Time taken by row major order ` `    ``Instant start = Instant.now(); ` `    ``rowMajor(); ` `    ``Instant end = Instant.now(); ` `        ``System.out.println(``"Row major access time : "``+  ` `                    ``Duration.between(start, end)); ` `     `  `    ``// Time taken by column major order ` `    ``start = Instant.now(); ` `    ``colMajor(); ` `    ``end = Instant.now(); ` `    ``System.out.printf(``"Column major access time : "``+  ` `                    ``Duration.between(start, end)); ` `} ` `} ` ` `  `// This code is contributed by 29AjayKumar `

Output:
```Row major access time :0.492000 s
Column major access time :1.621000 s
```

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.

Check out this Author's contributed articles.

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.

Improved By : 29AjayKumar

Article Tags :
Practice Tags :