Hi guys. I need some help on constructing an algorithm. The question is:
Derive an algorithm to store the elements of a table with size n by n in a computer memory using row major. Obtain the elements of the table by:
1. Row 1 Column 1 has the value 1; obtained by (1*1)
2. Row 2 Column 6 = 12 (2*6)
3. Row m Column n = mn (m*n)
All help will be gladly accepted and appreciated. Thanx!
We have placed cookies on your device to help make this website better. You can adjust your cookie settings, otherwise we'll assume you're okay to continue.