A brief discussion on an algorithm in C language

Let's talk about this algorithm in detail.

For example, there is a one-dimensional array with 96 elements. I want to divide it into 32 columns and 3 rows, and then into 16 columns and 6 rows. I also want to take the table elements from the head of the row and column respectively. For example, tab[]={0x08,0xa0,.......,0xff}; (You may think of dividing it into a multidimensional array and then using two for loops, such as for(int i=0;i<3;i++)

{

for(int j=0;j<32;j++)

tab[i][j];

}

But it’s still not flexible enough)

How can I change it flexibly? It is impossible to list two data tables, right? I thought hard for two days and looked up old books. Finally, I used a shift method. First, I took the element count from its array table, and then did the shift and addition and subtraction operations.

I did a test and the result was quite good. See the picture

In this way, you can get the size of the table and change the values ​​of a, b, 4, 5. To get the desired result. This can be made into a small subroutine. The compiled file is also quite small, suitable for selecting larger element tables. Sometimes short statements are not an advantage (in microcontrollers). Statements that are suitable for machine reading are good. Of course, which is better, 2+2 or 2*2? The machine knows, I believe, you know... If you can save the loop statement occupying MCU system resources. Haha, why not?