public class RowvColumn
{
public static void main(String[] args)
{
/**This program compares the run-time between row-major and column major
* ordering.
*/
//creating a 2d Array
int[][] twoD = new int[5000][5000];
long start = System.currentTimeMillis();
for (int row = 0 ; row < twoD.length; row++)
{
for (int col = 0; col < twoD[row].length; col++)
{
twoD[row][col] = row + col;
}
}
long mid = System.currentTimeMillis();
for (int row = 0; row < twoD.length; row++)
{
for (int col = 0; col < twoD[row].length; col++)
{
twoD[col][row] = row + col;
}
}
long end = System.currentTimeMillis();
System.out.println("Speed to traverse Row-Major (Milliseconds): " + (mid - start));
System.out.println("Speed to traverse Column-Major (Milliseconds): " + (end-mid));
}
}
Using the example code from Row vs. Column Major, answer the following questions in complete sentences:
Is Row-Major or Column-Major order faster? Why do you think that is. Please explain using execution counts.
In what scenario would you use Row-Major ordering when traversing a 2D array? In what scenario would you use Column-Major ordering?

The provided example code indicates that Row-Major order is quicker than Column-Major order.

The order that elements of a two-dimensional array are kept in memory is referred to as row-major. The items of one row are kept together in a row-major order, then the elements of the next row, and so on. This makes it efficient to iterate across each row of the array, accessing its elements one at a time. The array can be traversed more quickly column by column when the components of a column are stored together in column-major order. Programming languages like C and Java frequently employ row-major ordering. It is helpful for operations like matrix multiplication or linear algebra that require iterating through a matrix's rows.

Learn more about Row-Major here:

https://brainly.com/question/29758232

#SPJ4