Comparative study of row major ordering and column major ordering in accessing elements of 2 Dimensional Arrays

Abstract

The main focus of this paper is to compare the execution time between row major ordering and column major ordering for accessing matrix elements. The aim is to
design a program, which generates two matrices with various dimensions, and accessing the matrix elements using both ways row major and column major ordering.. The execution time of eachalgorithm is recorded to evaluate the performance of each algorithm. The programming language used this project is C Language. The overall finding is that the row major ordering algorithm is more efficient than column major ordering on large size of matrices. However, in scientific computing, memory has to be considered. To implement this we need need large size of matrix.