Ask your own question, for FREE!
Computer Science 11 Online
OpenStudy (anonymous):

how do i: Write a program to input 2 numbers, first and diff. The program will then create a one-dimensional array of 16 elements in an arithmetic sequence which is printed out.  For example, if first is 21 and diff = 5, the arithmetic sequence will be:  21 26 31 36 41 46 51 56 61 66 71 76 81 86 91 96

OpenStudy (anonymous):

since you didn't specified any language so here's a program in python first = input('Enter the first number: ') diff = input('Enter the difference among the numbers: ') count=0 while count < 16: print first first = first + diff count+=1

OpenStudy (anonymous):

int output[] = new output[16]; for (int i=0, i<16, i++) { output[i] = first + (diff * i); } It helps to ask a more specific question so we know what you're stumped on exactly and if you need to know something in a particular language or if psuedo code is suitable. I've answered above only what I guess would be the most trivial part of your problem, in a C#/Java-like language.

OpenStudy (anonymous):

First thing to tell scherniak, please specify the language you use. So, other can help you.

OpenStudy (anonymous):

Thanks a alot! How can i do the same with a 2d array (in java)?

OpenStudy (anonymous):

Be more specific - what exactly do you want to do with the 2d array?

OpenStudy (anonymous):

input 2 numbers, first and diff. The program will then create a two-dimensional array of 4x4 in an arithmetic sequence which is printed out. For example, if first is 21 and diff = 5, the arithmetic sequence will be: 21 26 31 36 41 46 51 56 61 66 71 76 81 86 91 96

OpenStudy (anonymous):

for(int i = 0;i<4;i++) { for(int j = 0; j<4; j++) { output[i][j] = (cant figure out what to put here) } }

OpenStudy (anonymous):

Ah okay. output[i][j] = first + (diff * ((i * 4) + j) );

OpenStudy (anonymous):

also... how can i reverse the diagonals? eg. have no idea how to approach this 96 26 31 81 41 71 66 56 61 51 46 76 36 86 91 21

OpenStudy (anonymous):

Here's one way you could do it: for(int i = 0;i<4;i++) { for(int j = 0; j<4; j++) { if (i==j) { output[i][j] = first + (diff * ( ((3-i) * 4) + (3-j) ); } else { output[i][j] = first + (diff * ((i * 4) + j) ); } } }

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!